Approximating graphic TSP by b-matchings
cs.DS, cs.DM, math.CO, math.OC
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/Mehrdad-Sohrabi/Graphic-TSP
Terminology
Sources
- Approximating Graphic TSP by Matchings
- 13/9-approximation for Graphic TSP
- An improved analysis of the M\"omke-Svensson algorithm for graph-TSP on subquartic graphs
- A (Slightly) Improved Approximation Algorithm for Metric TSP
- A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs
- Extending Exact Integrality Gap Computations for the Metric TSP
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time