Volume 4059 of the series Lecture Notes in Computer Science pp 184-195
On the Approximation Hardness of Some Generalizations of TSP
- Hans-Joachim BöckenhauerAffiliated withDepartment of Computer Science, ETH Zurich
- , Juraj HromkovičAffiliated withDepartment of Computer Science, ETH Zurich
- , Joachim KneisAffiliated withDepartment of Computer Science, RWTH Aachen University
- , Joachim KupkeAffiliated withDepartment of Computer Science, ETH Zurich
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.
Keywords
TSP with time windows approximation inapproximability- Title
- On the Approximation Hardness of Some Generalizations of TSP
- Book Title
- Algorithm Theory – SWAT 2006
- Book Subtitle
- 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006. Proceedings
- Pages
- pp 184-195
- Copyright
- 2006
- DOI
- 10.1007/11785293_19
- Print ISBN
- 978-3-540-35753-7
- Online ISBN
- 978-3-540-35755-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 4059
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Keywords
-
- TSP with time windows
- approximation
- inapproximability
- Industry Sectors
- eBook Packages
- Editors
-
- Lars Arge (16)
- Rusins Freivalds (17)
- Editor Affiliations
-
- 16. MADALGO, Department of Computer Science, University of Aarhus
- 17. Institute of Mathematics and Computer Science, University of Latvia
- Authors
-
- Hans-Joachim Böckenhauer (18)
- Juraj Hromkovič (18)
- Joachim Kneis (19)
- Joachim Kupke (18)
- Author Affiliations
-
- 18. Department of Computer Science, ETH Zurich, Switzerland
- 19. Department of Computer Science, RWTH Aachen University, Germany
Continue reading...
To view the rest of this content please follow the download PDF link above.