Image de couverture de livre

Extending Exact Integrality Gap Computations for the Metric TSP

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cook, William, Hougardy, Stefan, Petrich, Moritz
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Data Structures and Algorithms 68W25, 68W40, 68Q25, 90C27 F.2.2; G.2.1; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
par: Li, Shisheng
Publié: (2026)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
par: Foos, Josefine, et autres
Publié: (2023)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
par: Rockel-Wolff, Benjamin
Publié: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Approximation algorithms for the prize-collecting rural postman problem
par: Li, Hong, et autres
Publié: (2026)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

On the twin-width of near-regular graphs
par: Heinrich, Irene, et autres
Publié: (2025)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
par: Zhong, Xianghui
Publié: (2018)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
par: Laekhanukit, Bundit
Publié: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
par: Opris, Andre, et autres
Publié: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
par: Opris, Andre
Publié: (2025)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
par: Mundhra, S.
Publié: (2025)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)