Yair Bartal
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].
Supplemental Material
- D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton, NJ, USA, 2007. Google Scholar
Digital Library
- I. Abraham, Y. Bartal, and O. Neiman. Embedding metric spaces in their intrinsic dimension. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 363--372, 2008. Google ScholarDigital Library
- I. Abraham, Y. Bartal, and O. Neiman. Advances in metric embedding theory. Advances in Mathematics}, 228(6):3026 -- 3126, 2011.Google Scholar
- I. Abraham, S. Chechik, C. Gavoille, and D. Peleg. Forbidden-set distance labels for graphs of bounded doubling dimension. In 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pages 192--200. ACM, 2010. Google ScholarDigital Library
- S. Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM, 45:753--782, 1998. Google ScholarDigital Library
- S. Arora, P. Raghavan, and S. Rao. Approximation schemes for euclidean k-medians and related problems. In 30th annual ACM symposium on Theory of computing, pages 106--113. ACM, 1998. Google ScholarDigital Library
- P. Assouad. Plongements lipschitziens dans R spn. Bull. Soc. Math. France, 111(4):429--448, 1983.Google ScholarCross Ref
- Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, pages 184--193. IEEE Computer Society, 1996. Google ScholarDigital Library
- Y. Bartal. On approximating arbitrary metrices by tree metrics. In 30th annual ACM symposium on Theory of computing, pages 161--168. ACM, 1998. Google ScholarDigital Library
- Y. Bartal, B. Recht, and L. J. Schulman. Dimensionality reduction: beyond the johnson-lindenstrauss bound. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 868--887. SIAM, 2011. Google ScholarDigital Library
- T.-H. H. Chan and K. M. Elbassioni. A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics. Discrete & Computational Geometry, 46(4):704--723, 2011. Google ScholarDigital Library
- R. Cole and L.-A. Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In 38th annual ACM symposium on Theory of computing, pages 574--583, 2006. Google ScholarDigital Library
- T.-H. H. Chan and A. Gupta. Approximating {TSP} on metrics with bounded global growth. In 19th annual ACM-SIAM symposium on Discrete algorithms, pages 690--699. SIAM, 2008. Google ScholarDigital Library
- T.-H. H. Chan, A. Gupta, and K. Talwar. Ultra-low-dimensional embeddings for doubling metrics. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms}, SODA '08, pages 333--342. Society for Industrial and Applied Mathematics, 2008. Google ScholarDigital Library
- N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Carnegie-Mellon Univ. Management Sciences Research Group, 1976.Google Scholar
- A. Czumaj and A. Lingas. A polynomial time approximation scheme for euclidean minimum cost k-connectivity. In 25th International Colloquium on Automata, Languages and Programming, ICALP '98, pages 682--694. Springer-Verlag, 1998. Google ScholarDigital Library
- K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom.}, 22(1):63--93, 1999.Google Scholar
- A. Czumaj, A. Lingas, and H. Zhao. Polynomial-time approximation schemes for the euclidean survivable network design problem. In 29th International Colloquium on Automata, Languages and Programming, ICALP '02, pages 973--984. Springer-Verlag, 2002. Google ScholarDigital Library
- J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In 35th annual ACM symposium on Theory of computing, pages 448--455. ACM, 2003. Google ScholarDigital Library
- J. Gao, L. J. Guibas, and A. Nguyen. Deformable spanners and applications. Comput. Geom. Theory Appl., 35(1), 2006. Google ScholarDigital Library
- L.-A. Gottlieb and R. Krauthgamer. A nonlinear approach to dimension reduction. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 888--899. SIAM, 2011. Google ScholarDigital Library
- L.-A. Gottlieb, L. Kontorovich, and R. Krauthgamer. Efficient classification for metric data. In 23rd Conference on Learning Theory}, pages 433--440. Omnipress, 2010.Google Scholar
- A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03, pages 534--543. IEEE Computer Society, 2003. Google ScholarDigital Library
- G. Gutin and A. P. Punnen, editors. The traveling salesman problem and its variations, volume 12 of Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht, 2002. Google ScholarDigital Library
- L.-A. Gottlieb and L. Roditty. An optimal dynamic spanner for doubling metric spaces. In Proceedings of the 16th annual European symposium on Algorithms, ESA '08, pages 478--489. Springer-Verlag, 2008. Google ScholarDigital Library
- R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations. Plenum Press, 1972.Google ScholarCross Ref
- R. Krauthgamer and J. R. Lee. Navigating nets: {S}imple algorithms for proximity search. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 791--801, January 2004. Google ScholarDigital Library
- S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the Euclidean k-median problem. SIAM J. Comput., 37:757--782, June 2007. Google ScholarDigital Library
- T. J. Laakso. Ahlfors Q-regular spaces with arbitrary Q>1 admitting weak Poincar'e inequality. Geom. Funct. Anal.}, 10(1):111--123, 2000.Google Scholar
- T. J. Laakso. Plane with A infty-weighted metric not bi-Lipschitz embeddable to B R sp N. Bull. London Math. Soc., 34(6):667--676, 2002.Google ScholarCross Ref
- J. R. Lee. The Godel prize, TSP, and volume growth (blog post). http://tcsmath.wordpress.com/2010/06/24/the-godel-prize-tsp-and-volume-growth, June 2010.Google Scholar
- E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. Wiley-Interscience series in discrete mathematics, 1985.Google Scholar
- U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata, 87(1--3):285--307, 2001.Google Scholar
- J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric {TSP}, k-MST, and related problems. SIAM J. Comput., 28(4):1298--1309, 1999. Google ScholarDigital Library
- J. S. B. Mitchell. A PTAS for TSP with neighborhoods among fat regions in the plane. In 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 11--18. SIAM, 2007. Google ScholarDigital Library
- C. H. Papadimitriou. The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science, 4(3):237 -- 244, 1977.Google ScholarCross Ref
- C. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. Combinatorica, 26:101--120, 2006. Google ScholarDigital Library
- C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. Oper. Res., 18:1--11, February 1993. Google ScholarDigital Library
- G. Reinelt. The Traveling Salesman, volume 840 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.Google Scholar
- S. B. Rao and W. D. Smith. Approximating geometrical graphs via "spanners" and "banyans". In 30th annual ACM symposium on Theory of computing, pages 540--550. ACM, 1998. Google ScholarDigital Library
- M. Smid. On some combinatorial problems in metric spaces of bounded doubling dimension. Manuscript, available at http://people.scs.carleton.ca/ michiel/research.html, 2010.Google Scholar
- K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In 36th annual ACM symposium on Theory of computing, pages 281--290. ACM, 2004. Google ScholarDigital Library
- L. Trevisan. When Hamming meets Euclid: The approximability of geometric TSP and Steiner tree. SIAM Journal on Computing, 30(2):475--485, 2000. Google ScholarDigital Library
Index Terms
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
Recommendations
Traveling salesman problem under categorization
We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem. It is shown that these problems are strongly NP-complete on Halin graphs ...
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial ...
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of colors. We derive results regarding hardness of approximation and analyze ...
Comments