13/9-approximation for Graphic TSP

The Travelling Salesman Problem is one of the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides's algorithm with approximation factor of 3/2, even though the so-called Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only 4/3. Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al. (2011), and then by Momke and Svensson (2011). In this paper, we provide an improved analysis of the approach used by the latter, yielding a bound of 13/9 on the approximation factor, as well as a bound of 19/12+epsilon for any epsilon>0 for a more general Travelling Salesman Path Problem in graphic metrics.

[1]  Ola Svensson,et al.  Approximating Graphic TSP by Matchings , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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

[4]  Michel X. Goemans,et al.  On the parsimonious property of connectivity problems , 1990, SODA '90.

[5]  David P. Williamson,et al.  Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

[6]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

[9]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.