@inproceedings{58bd380aed7d44bc8b16408a74fdd81c,

title = "The traveling salesman problem: Low-dimensionality implies a polynomial time approximation scheme",

abstract = "The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1 + ε)-approximation to the optimal tour, for any fixed ε > 0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension. The celebrated results of Arora [Aro98] and Mitchell [Mit99] prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality of the space and not on its specific geometry. This result resolves a problem that has been open since the quasi-polynomial time algorithm of Talwar [Tal04].",

keywords = "doubling metrics, traveling salesman problem",

author = "Yair Bartal and Gottlieb, {Lee Ad} and Robert Krauthgamer",

year = "2012",

doi = "10.1145/2213977.2214038",

language = "American English",

isbn = "9781450312455",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "663--672",

booktitle = "STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing",

note = "44th Annual ACM Symposium on Theory of Computing, STOC '12 ; Conference date: 19-05-2012 Through 22-05-2012",

}