On the approximation hardness of some generalizations of TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 184-195

  Böckenhauer, Hans Joachim ^a   Hromkovic, Juraj ^a   Kneis, Joachim ^b   Kupke, Joachim ^a  

^a ETH ZURICH   (Switzerland)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Approximation; Inapproximability; TSP with time windows

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHM; GENERALIZATION; INAPPROXIMABILITY; TSP WITH TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 33746453771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_19     Document Type: Conference Paper

References (16)

1. T. Andreae: On the Traveling Salesman Problem Restricted to Inputs Satisfying a Relaxed Triangle Inequality. Networks 38 (2001), pp. 59-67.
2. T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM Journal on Discrete Mathematics 8 (1995), pp. 1-16.
3. N. Bansal, A. Blum, S. Chawla, A. Meyersou: Approximation algorithms for deadline-TSP and vehicle routing with time windows. Proc. 36th ACM Symposium on the Theory of Computing (STOC'04), pp. 166-174.
4. M. Bender, C. Chekuri: Performance guarantees for TSP with a parametrized triangle inequality. IPL 73 (2000), pp. 17-21.
5. H.-J. Böckenhauer, D. Bongartz, L. Forlizzi, J. Hromkovic, J. Kneis, J. Kupke, G. Proietti, S. Seibert, W. Unger: Approximation algorithms for the OTSP. Unpublished manuscript, 2005.
6. H.-J. Böckenhauer, J. Hromkovic, R. Klasing, S. Seibert, W. Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. TCS 285 (2002), pp. 3-24.
7. H.-J. Böckenhauer, J. Hromkovic, J. Kneis, J. Kupke: On the parameterized approximability of TSP with deadlines. To appear in Theory of Computing Systems.
8. H.-J. Böckenhauer, S. Seibert: Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications 34 (2000), pp. 213-255.
9. M. Charikar, R. Motwani, P. Raghavan, C. Silverstein: Constrained TSP and low-power computing. Proc. 5th International Workshop on Algorithms and Data Structures (WADS'97), LNCS 2125 (1997), pp. 104-115.
10. N. Christofides: 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.
11. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon, F. Soumis: VRP with time windows. In: P. Toth, D. Vigo (eds.): The Vehicle Routing Problem, SIAM 2001, pp. 157-193.
12. L. Forlizzi, J. Hromkovič, G. Proietti, S. Seibert: On the stability of approximation for Hamiltonian path problems. Proc. SOFSEM 2005: Theory and Practice of Computer Science, LNCS 3381, Springer 2005, pp. 147-156.
13. M. R. Garey, D. S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, 1979.
14. D. Gusfield: Algorithms on Strings, Trees, and Sequences, Cambridge University Press 1997.
15. J. Hromkovič: Stability of approximation algorithms for hard optimization problems. Proc. SOFSEM'99, Springer LNCS 1725, 1999, pp. 29-47.
16. Ch. Papadimitriou, S. Vempala: On the approximability of the traveling salesman problem. Proc. 32nd Ann. Symp. on Theory of Cornp. (STOC '00), ACM 2000. Corrected full version available at http://www.cs.berkeley.edu/~christos/