{"paper":{"title":"Eight-Fifth Approximation for TSP Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'as Seb\\\"o","submitted_at":"2012-09-16T21:47:51Z","abstract_excerpt":"We prove the approximation ratio 8/5 for the metric $\\{s,t\\}$-path-TSP problem, and more generally for shortest connected $T$-joins.\n  The algorithm that achieves this ratio is the simple \"Best of Many\" version of Christofides' algorithm (1976), suggested by An, Kleinberg and Shmoys (2012), which consists in determining the best Christofides $\\{s,t\\}$-tour out of those constructed from a family $\\Fscr_{>0}$ of trees having a convex combination dominated by an optimal solution $x^*$ of the fractional relaxation. They give the approximation guarantee $\\frac{\\sqrt{5}+1}{2}$ for such an $\\{s,t\\}$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3523","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}