Overview of New Approaches for Approximating TSP
- Cite this paper as:
- Svensson O. (2013) Overview of New Approaches for Approximating TSP. In: Brandstädt A., Jansen K., Reischuk R. (eds) Graph-Theoretic Concepts in Computer Science. WG 2013. Lecture Notes in Computer Science, vol 8165. Springer, Berlin, Heidelberg
In this extended abstract, we survey some of the recent results on approximating the traveling salesman problem on graphic metrics.
We start by briefly explaining the algorithm of Oveis Gharan et al.  that has strong similarities to Christofides’ famous 3/2-approximation algorithm. We then explain the main ideas behind an alternative approach introduced by Mömke and the author . The new ingredient in our approach is that it allows for the removal of certain edges while simultaneously yielding a connected, Eulerian graph, which in turn leads to a decreased cost. We also overview the exciting developments for TSP on graphic metrics that rapidly followed: an improved analysis of our algorithm by Mucha  yielding an approximation guarantee of 1.44, and the recent developments by Sebö and Vygen  who gave a 1.4-approximation algorithm.
Finally, we point out some interesting open problems where our techniques currently fall short of applying to more general metrics.
Keywordsapproximation algorithms graph theory traveling salesman problem
Unable to display preview. Download preview PDF.