arXiv (All)
open access
A Sharper Explicit Bound on the Subtour-LP Integrality Gap for Metric TSP
Karlin, Klein, and Oveis Gharan introduced a randomized better-than-$3/2$ approximation algorithm for metric TSP [KKO21] and subsequently established the corresponding improvement in the integrality gap of the subtour-elimination LP [KKO22], with an explicit constant $\varepsilon>1.00000\cdot10^{-36
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm#1129736
- min_G max_D E_x[log(D(x))] + E_z[log(1-D(G(z)))]. Konkurrenz in KI-Kunst#622716
- Kalai's Conjecture for Tight Trees#985413
- Improved bounds for universal convex covers of unit arcs#1036356
Record · ID 1128863
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive