The parameterized approximability of TSP with deadlines

Theory of Computing Systems

Volumn 41, Issue 3, 2007, Pages 431-444

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

^a ETH ZURICH   (Switzerland)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; APPROXIMATION RATIOS; COMBINING METHOD; HARD PROBLEMS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; TRIANGLE INEQUALITY;

HARDNESS; PARAMETERIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 36849055988     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-1347-x     Document Type: Conference Paper

References (17)

1. T. Andreae: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38 (200.1), 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), 1-16.
3. V. Arvind, V. Raman: Approximation Algorithms for some Parameterized Counting Problems. ECCCTR02-031.
4. N. Bansal, A. Blum, S. Chawla, A. Meyerson: 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, 2004.
5. M. Bender, C. Chekuri: Performance guarantees for TSP with a parametrized triangle inequality. Information Processing Letters 73 (2000), 17-21.
6. H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoretical Computer Science 285 (2002), 3-24.
7. 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, PA, 1976.
8. L. Cai, J. Chen: On fixed-parameter tractability and approximability of NP optimization problems. Proc. 2nd Israel Symposium Theory of Computing and Systems, pp. 118-126, 1993.
9. 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, pp. 157-193. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA, 2001.
10. M. Cesati and L. Trevisan: On the efficiency of polynomial time approximation schemes. ECCC TR97-001.
11. R.G. Downey, M.R. Fellows: Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, New York, first edition, 1999.
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, pp. 147-156. LNCS 338.1. Springer, Berlin, 2005.
13. M. R. Garey, D. S. Johnson.: Computers and Intractability-A. Guide to the Theory of NPCompleteness. Freeman, San Francisco, CA, 1979.
14. J. Hromkovič: Stability of approximation algorithms for hard optimization problems. Proc. SOFSEM '99, pp. 29-47. LNCS 1725. Springer, Berlin, 1999.
15. J. Hromkovič: Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Ran-domization, Approximation, and Heuristics. Springer, Berlin, 2003.
16. Ch. Papadimitriou, K. Steiglitz: Combinatorial Optimization: Algorithms and Complexity.PrenticeHall, Englewood Cliffs, NJ, 1982.
17. Ch. Papadimitriou, S. Vempala: On the approximability of the traveling salesman, problem. Proc. 32nd Annual Symposium on Theory of Computing (STOC '00), ACM, New York, 2000. Corrected full version available at http://www.cs.berkeley.edu/~christos/