Abstract
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We want to find a tour of minimum length that visits at least one point in each region. This unifies the TSP with Neighborhoods and the Group Steiner Tree problem. We give a (9.1α+1)-approximation algorithm for the case when the regions are disjoint α-fat objects with possibly varying size. This considerably improves the best results known, in this case, for both the group Steiner tree problem and the TSP with Neighborhoods problem. We also give the first O(1)-approximation algorithm for the problem with intersecting regions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3), 197–218 (1994)
Arora, S.: Nearly linear time approximation schemes for euclidean TSP and other geometric problems. J. ACM 45(5), 1–30 (1998)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University (1976)
de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with Neighborhoods of varying size. In: Proceedings 10th Annual European Symposium on algorithms (ESA), pp. 187–199 (2002)
Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)
Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings 8th Annual ACM Symposium on the Theory of Computing, STOC (1976)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1), 66–84 (2000)
Gudmundsson, J., Levcopoulos, C.: Hardness result for TSP with neighborhoods, Technical Report LU-CS-TR:2000-216, Department of Computer Science, Lund University, Sweden (2000)
Mitchell, J.S.B.: Guillotine subdivions approximate polygonal subdivisons: A simple polynomial-time approximation scheme for geometric TSP, k-MST and related problems. SICOMP 28(4), 1298–1309 (1999)
Mitchel, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, pp. 633–701. Elsevier, North-Holland, Amsterdam (2000)
Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Proceedings 11th Ann. ACM Symposium on Computational Geometry, pp. 360–369 (1995)
Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4(3), 237–244 (1977)
Reich, G., Widmayer, P.: Beyond steiner’s problem: a VLSI oriented generalization. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 196–210. Springer, Heidelberg (1990)
Slavik, P.: A tight analysis of the greedy algorithm for set cover. In: STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 435–441 (1996)
Slavik, P.: The errand scheduling problem. Technical report, March 14, Technical Report, SUNY, Buffalo, USA (1997)
Safra, S., Schwartz, O.: On the complexity of approximating TSP with Neighborhoods and related problems. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 446–458. Springer, Heidelberg (2003)
van der Stappen, A.F.: Motion Planning amidst Fat Obstacles. Ph.d. dissertation, Utrecht University, Utrecht, Netherlands (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elbassioni, K., Fishkin, A.V., Mustafa, N.H., Sitters, R. (2005). Approximation Algorithms for Euclidean Group TSP. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_90
Download citation
DOI: https://doi.org/10.1007/11523468_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)