A 1.5-Approximation for Path TSP

We present a $1.5$-approximation for the Metric Path Traveling Salesman Problem (Path TSP). All recent improvements on Path TSP crucially exploit a structural property shown by An, Kleinberg, and Shmoys [Journal of the ACM, 2015], namely that narrow cuts with respect to a Held-Karp solution form a chain. We significantly deviate from these approaches by showing the benefit of dealing with larger $s$-$t$ cuts, even though they are much less structured. More precisely, we show that a variation of the dynamic programming idea recently introduced by Traub and Vygen [SODA, 2018] is versatile enough to deal with larger size cuts, by exploiting a seminal result of Karger on the number of near-minimum cuts. This avoids a recursive application of dynamic programming as used by Traub and Vygen, and leads to a considerably simpler algorithm avoiding an additional error term in the approximation guarantee. We match the still unbeaten $1.5$-approximation guarantee of Christofides' algorithm for TSP. Hence, any further progress on the approximability of Path TSP will also lead to an improvement for TSP.

[1]  Michel X. Goemans,et al.  Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[2]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[3]  David B. Shmoys,et al.  Improving christofides' algorithm for the s-t path TSP , 2011, STOC '12.

[4]  Toshihide Ibaraki,et al.  Computing All Small Cuts in an Undirected Network , 1997, SIAM J. Discret. Math..

[5]  TraubVera,et al.  Approaching 3/2 for the s-t-path TSP , 2019 .

[6]  Jens Vygen,et al.  Better s-t-Tours by Gao Trees , 2016, IPCO.

[7]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[8]  Vera Traub,et al.  Approaching 3/2 for the s-t-path TSP , 2019, J. ACM.

[9]  Marcin Mucha.  13/9-approximation for Graphic TSP , 2012, STACS.

[10]  Jens Vygen,et al.  Reassembling Trees for the Traveling Salesman , 2015, SIAM J. Discret. Math..

[11]  András Sebö,et al.  The Salesman's Improved Paths: A 3/2+1/34 Approximation , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[13]  Ola Svensson,et al.  Removing and Adding Edges for the Traveling Salesman Problem , 2016, J. ACM.

[14]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[15]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.

[16]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[17]  András Sebö,et al.  Eight-Fifth Approximation for the Path TSP , 2012, IPCO.

[18]  Zhihan Gao.  On the Metric s-t Path Traveling Salesman Problem , 2015, SIAM J. Discret. Math..

[19]  Vera Traub,et al.  Layers and Matroids for the Traveling Salesman's Paths , 2017, Oper. Res. Lett..

[20]  Vera Traub,et al.  An improved upper bound on the integrality ratio for the s-t-path TSP , 2019, Oper. Res. Lett..

[21]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[22]  A. J.,et al.  Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .

[23]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[24]  Santosh S. Vempala,et al.  A convex relaxation for the asymmetric TSP , 1999, SODA '99.

[25]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[26]  Jens Vygen,et al.  Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs , 2012, ArXiv.