Abstract
We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tour that visits each of a collection of n subsets (regions or neighborhoods) in the underlying metric space. We give a quasi-polynomial time approximation scheme (QPTAS) when the regions are what we call α-fat weakly disjoint. This notion combines the existing notions of diameter variation, fatness and disjointness for geometric objects and generalizes these notions to any arbitrary metric space. Intuitively, the regions can be grouped into a bounded number of types, where in each type, the regions have similar upper bounds for their diameters, and each such region can designate a point such that these points are far away from one another.
Our result generalizes the polynomial time approximation scheme (PTAS) for TSPN on the Euclidean plane by Mitchell (in SODA, pp. 11–18, 2007) and the QPTAS for TSP on doubling metrics by Talwar (in 36th STOC, pp. 281–290, 2004). We also observe that our techniques directly extend to a QPTAS for the Group Steiner Tree Problem on doubling metrics, with the same assumption on the groups.
Article PDF
Similar content being viewed by others
References
Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197–218 (1994)
Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1), 11–24 (1989)
Arora, S.: Approximation algorithms for geometric TSP. In: The Traveling Salesman Problem and Its Variations. Comb. Optim., vol. 12, pp. 207–221. Kluwer Acad., Dordrecht (2002)
Assouad, P.: Plongements Lipschitziens dans R n. Bull. Soc. Math. Fr. 111(4), 429–448 (1983)
Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: 37th FOCS, pp. 184–193 (1996)
Clementi, A.E.F., Crescenzi, P., Rossi, G.: On the complexity of approximating colored-graph problems. In: Proc. 5th Internat. Computing and Combinatorics Conference. Lecture Notes in Computer Science, vol. 1627, pp. 281–290. Springer, Berlin (1999)
Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: 16th SODA, pp. 762–771 (2005)
Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete Comput. Geom. 22(1), 63–93 (1999)
de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57, 22–36 (2005)
Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)
Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)
Dror, M., Orlin, J.B.: Combinatorial optimization with explicit delineation of the ground set by a collection of subsets. SIAM J. Discrete Math. 21(4), 1019–1034 (2008)
Elbassioni, K., Fishkin, A.V., Mustafa, N., Sitters, R.: Approximation algorithms for Euclidean group TSP. In: ICALP. Lecture Notes in Computer Science, vol. 3580, pp. 1115–1126. Springer, Berlin (2005)
Elbassioni, K., Fishkin, A.V., Sitters, R.: Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods. Int. J. Comput. Geom. Appl. 19(2), 173–193 (2009)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)
Feremans, C., Grigoriev, A.: Approximation schemes for the generalized geometric problems with geographic clustering. In: Proceedings of the 21st European Workshop on Computational Geometry EWCG, pp. 101–102 (2005)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66–84 (2000). Preliminary version in 9th SODA, pp. 253–259 (1998)
Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods. Nord. J. Comput. 6(4), 469–488 (1999)
Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th FOCS, pp. 534–543 (2003)
Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 585–594. ACM Press, New York (2003)
Har-Peled, S., Mendel, M.: Fast constructions of nets in low dimensional metrics, and their applications. In: 21st SOCG, pp. 150–158 (2005)
Krauthgamer, R., Lee, J.R.: Navigating nets: Simple algorithms for proximity search. In: 15th SODA, pp. 798–807 (2004)
Krauthgamer, R., Lee, J.R.: The black-box complexity of nearest-neighbor search. Theor. Comput. Sci. 348(2–3), 262–276 (2005)
Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Proc. 11th Annual ACM Symposium on Computational Geometry, pp. 360–369 (1995)
Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)
Mitchell, J.S.B.: 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)
Mitchell, J.S.B.: A PTAS for TSP with neighborhoods among fat regions in the plane. In: SODA, pp. 11–18 (2007)
Mitchell, J.S.B.: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. In: Symposium on Computational Geometry, pp. 183–191 (2010)
Rao, S.B., Smith, W.D.: Approximating geometrical graphs via “spanners” and “banyans”. In: STOC ’98, Dallas, TX, pp. 540–550. ACM, New York (1999)
Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. Comput. Complex. 14(4), 281–307 (2006)
Talwar, K.: Bypassing the embedding: Algorithms for low-dimensional metrics. In: 36th STOC, pp. 281–290 (2004)
van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D. Dissertation, Department of Computer Science, Utrecht University, Utrecht, Netherlands (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of the paper has appeared in SODA 2010.
This research was done while T-H.H. Chan was at Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Chan, TH.H., Elbassioni, K. A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discrete Comput Geom 46, 704–723 (2011). https://doi.org/10.1007/s00454-011-9337-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9337-9