:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Alipour, Sharareh
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2602.07720
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
por: Alipour, Sharareh, et al.
Publicado: (2025)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)

Submodular Max-Min Allocation under Identical Valuations
por: Boehmer, Kimon
Publicado: (2026)

Efficient stream-based Max-Min diversification with minimal failure rate
por: Kalogeratos, Argyris, et al.
Publicado: (2020)

Parameterized Max Min Feedback Vertex Set
por: Lampis, Michael, et al.
Publicado: (2023)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
por: Kurkure, Yash, et al.
Publicado: (2024)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

Robust Max Selection
por: Dang, Trung, et al.
Publicado: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
por: Fahrbach, Matthew, et al.
Publicado: (2024)

Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
por: Jamie, Pooriya, et al.
Publicado: (2024)

Min-Max Correlation Clustering via Neighborhood Similarity
por: Cao, Nairen, et al.
Publicado: (2025)

iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer
por: Ye, Muyang, et al.
Publicado: (2024)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
por: Shugart, Henry, et al.
Publicado: (2025)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
por: Ma, Qingwen, et al.
Publicado: (2026)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
por: Anand, Aditya, et al.
Publicado: (2025)

Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More
por: Stoian, Mihail
Publicado: (2026)

Approximate Min-Sum Subset Convolution
por: Stoian, Mihail
Publicado: (2024)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
por: Cai, Yang, et al.
Publicado: (2022)

Min-Sum Set Cover on Parallel Machines
por: Szyfelbein, Michał
Publicado: (2026)

Deterministic Monotone Min-Plus Product and Convolution
por: Jin, Ce, et al.
Publicado: (2026)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

FPT Approximations for Fair $k$-Min-Sum-Radii
por: Carta, Lena, et al.
Publicado: (2024)

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
por: Manurangsi, Pasin
Publicado: (2024)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

Improved Bounds for Rectangular Monotone Min-Plus Product and Applications
por: Dürr, Anita
Publicado: (2022)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
por: Jin, Wenyu, et al.
Publicado: (2024)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
por: Cheng, Yu, et al.
Publicado: (2024)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
por: de Vos, Tijn, et al.
Publicado: (2024)

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
por: Bhangale, Amey, et al.
Publicado: (2026)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
por: Bringmann, Karl, et al.
Publicado: (2024)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
por: Dong, Sally, et al.
Publicado: (2023)

Weighted Matching in the Random-Order Streaming and Robust Communication Models
por: Hashemi, Diba, et al.
Publicado: (2024)

Local Max-Cut on Sparse Graphs
por: Schwartzman, Gregory
Publicado: (2023)

Max-Distance Sparsification for Diversification and Clustering
por: Kumabe, Soh
Publicado: (2024)

Max-Cut with Multiple Cardinality Constraints
por: Makarychev, Yury, et al.
Publicado: (2025)