Abstract
Let G=(V,E) be a complete undirected graph with vertex set V, edge set E, and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clustersV 1, ..., V k . The clustered traveling salesman problem (CTSP) is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper, we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.
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
Anily, S., Bramel, J., Hertz, A.: A 5/3 -approximation algorithm for the clustered traveling salesman tour and path problems. Manuscript (December 1997)
Arkin, E., Hassin, R., Klein, L.: Restricted delivery problems on a network. Networks 29, 205–216 (1997)
Chisman, J.A.: The clustered traveling salesman problem. Computers & Operations Research 2, 115–119 (1975)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Operations Research 43, 399–414 (1995)
Frederickson, G.N.: Approximation algorithms for some postman problems. J. Assoc. Comput. Mach. 26, 538–554 (1979)
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178–193 (1978)
Hoogeveen, J.A.: Analysis of Christofides’ heuristic: Some paths are more difficult than cycles. Operations Research Letters 10, 291–295 (1991)
Gendreau, M., Hertz, A., Laporte, G.: The traveling salesman problem with backhauls. Computers and Operations Research 23, 501–508 (1996)
Gendreau, M., Laporte, G., Hertz, A.: An approximation algorithm for the traveling salesman problem with backhauls. Operations Research 45, 639–641 (1997)
Jansen, K.: An approximation algorithm for the general routing problem. Information Processing Letters 41, 333–339 (1992)
Johnson, D.S., Papadimitriou, C.H.: Performance guarantees for heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 145–180. Wiley, Chichester (1985)
Jongens, K., Volgenant, T.: The symmetric clustered traveling salesman problem. European Journal of Operational Research 19, 68–75 (1985)
Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Reinehart and Winston (1976)
Lokin, F.C.J.: Procedures for traveling salesman problems with additional constraints. European Journal of Operational Research 3, 135–141 (1978)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley & Sons, Chichester (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B. (1998). Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive