Improving Christofides' algorithm for the s-t path TSP
From MaRDI portal
Publication:3177743
Abstract: We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the two endpoints; Hoogeveen showed that the natural variant of Christofides' algorithm is a 5/3-approximation algorithm for this problem, and this asymptotically tight bound in fact has been the best approximation ratio known until now. We modify this algorithm so that it chooses the initial spanning tree based on an optimal solution to the Held-Karp relaxation rather than a minimum spanning tree; we prove this simple but crucial modification leads to an improved approximation ratio, surpassing the 20-year-old barrier set by the natural Christofides' algorithm variant. Our algorithm also proves an upper bound of (1+sqrt(5))/2 on the integrality gap of the path-variant Held-Karp relaxation. The techniques devised in this paper can be applied to other optimization problems as well: these applications include improved approximation algorithms and improved LP integrality gap upper bounds for the prize-collecting s-t path problem and the unit-weight graphical metric s-t path TSP.
Recommendations
Cited in
(37)- Approaching 3/2 for the \(s\)-\(t\)-path TSP
- Better \(s-t\)-tours by Gao trees
- The salesman's improved paths through forests
- A LP-based approximation algorithm for generalized traveling salesperson path problem
- A 1.5-approximation for path TSP
- On the approximation ratio of the path matching Christofides algorithm
- A constant-factor approximation for directed latency in quasi-polynomial time
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
- Approximation algorithms with constant ratio for general cluster routing problems
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs
- On the metric \(s\)-\(t\) path traveling salesman problem
- Scheduling on a graph with release times
- Better \(s\)-\(t\)-tours by Gao trees
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
- Analysis of a near-metric TSP approximation algorithm
- Eight-fifth approximation for the path TSP
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Algorithms for Euclidean degree bounded spanning tree problems
- Approaching \(\frac 23\) for the \(s\)-\(t\)-path TSP
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- Reducing Path TSP to TSP
- Reassembling trees for the traveling salesman
- Removing and adding edges for the traveling salesman problem
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
- \(\frac{13}{9}\)-approximation for graphic TSP
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
- Reducing path TSP to TSP
- Improving on best-of-many-Christofides for \(T\)-tours
- \(\frac {13}{9}\)-approximation for graphic TSP
- Slightly improved upper bound on the integrality ratio for the \(s - t\) path TSP
- An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Layers and matroids for the traveling salesman's paths
- Polyhedral techniques in combinatorial optimization: matchings and tours
- Improving the robustness of EPS to solve the TSP
This page was built for publication: Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177743)
