{"paper":{"title":"On the metric s-t path Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zhihan Gao","submitted_at":"2014-04-30T01:24:22Z","abstract_excerpt":"We study the metric $s$-$t$ path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing $\\frac{5}{3}$-approximation factor and presented an algorithm that achieves an approximation factor of $\\frac{1+\\sqrt{5}}{2}\\approx1.61803$. Later [Seb\\H{o}, IPCO 2013] further improved the approximation factor to $\\frac{8}{5}$. We present a simple, self-contained analysis that unifies both results; our main contribution is a \\emph{unified correction vector}. We compare two different linear programming (LP) relaxations of the $s$-$t$ path TSP, namely, the path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7569","kind":"arxiv","version":2},"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"}