Abstract
The aim of this paper is to investigate the approximability of some generalized versions of TSP which typically arise in practical applications. The most important generalization is TSP with time windows, where some vertices have to be visited after some specified opening time, but before some deadline. Our main results are as follows (assuming P ≠NP).
1. In contrast to the constant approximability of metric TSP, there is no polynomial-time o(|V|)-approximation algorithm for metric TSP with time windows.
2. Metric TSP with as few as two time windows is not approximable within ratio 2–ε.
3. There is no polynomial-time o(|V|)-approximation algorithm for TSP with a single time window and arbitrarily small violations of the triangle inequality.
4. Metric TSP with a prescribed linear order on some vertices can be solved in polynomial time with a constant approximation guarantee, even if the triangle inequality is violated by a constant factor.
This work was partially supported by SNF grant 200021-109252/1. A full version of Section 3 will appear in Theory of Computing Systems [7].
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
Andreae, T.: On the Traveling Salesman Problem Restricted to Inputs Satisfying a Relaxed Triangle Inequality. Networks 38, 59–67 (2001)
Andreae, T., Bandelt, H.-J.: Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM Journal on Discrete Mathematics 8, 1–16 (1995)
Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time windows. In: Proc. 36th ACM Symposium on the Theory of Computing (STOC 2004), pp. 166–174 (2004)
Bender, M., Chekuri, C.: Performance guarantees for TSP with a parametrized triangle inequality. IPL 73, 17–21 (2000)
Böckenhauer, H.-J., Bongartz, D., Forlizzi, L., Hromkovič, J., Kneis, J., Kupke, J., Proietti, G., Seibert, S., Unger, W.: Approximation algorithms for the OTSP (unpublished manuscript, 2005)
Böckenhauer, H.-J., Hromkovič, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. TCS 285, 3–24 (2002)
Böckenhauer, H.-J., Hromkovič, J., Kneis, J., Kupke, J.: On the parameterized approximability of TSP with deadlines. Theory of Computing Systems (to appear)
Böckenhauer, H.-J., Seibert, S.: Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications 34, 213–255 (2000)
Charikar, M., Motwani, R., Raghavan, P., Silverstein, C.: Constrained TSP and low-power computing. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 104–115. Springer, Heidelberg (1997)
Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 157–193. SIAM, Philadelphia (2001)
Forlizzi, L., Hromkovič, J., Proietti, G., Seibert, S.: On the stability of approximation for Hamiltonian path problems. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 147–156. Springer, Heidelberg (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Hromkovič, J.: Stability of approximation algorithms for hard optimization problems. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 29–47. Springer, Heidelberg (1999)
Papadimitriou, C., Vempala, S.: On the approximability of the traveling salesman problem. In: Proc. 32nd Ann. Symp. on Theory of Comp (STOC 2000). ACM Press, New York (2000), corrected full version available at: http://www.cs.berkeley.edu/~christos/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böckenhauer, HJ., Hromkovič, J., Kneis, J., Kupke, J. (2006). On the Approximation Hardness of Some Generalizations of TSP. In: Arge, L., Freivalds, R. (eds) Algorithm Theory – SWAT 2006. SWAT 2006. Lecture Notes in Computer Science, vol 4059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785293_19
Download citation
DOI: https://doi.org/10.1007/11785293_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35753-7
Online ISBN: 978-3-540-35755-1
eBook Packages: Computer ScienceComputer Science (R0)