Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem

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

Volumn 1767, Issue , 2000, Pages 72-86

  Böckenhauer, Hans Joachim ^a   Hromkovič, Juraj ^a   Klasing, Ralf ^a   Seibert, Sebastian ^a   Unger, Walter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Stability of approximation; Traveling salesman problem

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ALGORITHM AND COMPLEXITY; APPROXIMATION RATIOS; EFFICIENT APPROXIMATION ALGORITHMS; MULTIPLICATIVE CONSTANTS; OPTIMIZATION PROBLEMS; OPTIMIZATION TASK; POLYNOMIAL TIME APPROXIMATION; TRIANGLE INEQUALITY;

TRAVELING SALESMAN PROBLEM;

EID: 84912139323     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_7     Document Type: Article

References (24)

1. [Ar97] S. Arora: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE FOCS, 1997, pp. 554-563.
2. [Ar98] S. Arora: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. In: Journal of the ACM 45, No. 5 (Sep. 1998), pp. 753-782.
3. [AB95] T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discr. Math. 8 (1995), pp. 1-16.
4. [BC93] D. P. Bovet, P. Crescenzi: Introduction to the Theory of Complexity, Prentice-Hall 1993.
5. [BC99] M. A. Bender, C. Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. In: Proc. WADS'99, LNC'S, to appear.
6. [BHKSU00] H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality (Extended Abstract). In: Proc. STACS'00, LNCS, to appear.
7. [Chr76] N. Christofides: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1976.
8. [Co71] S. A. Cook: The complexity of theorem proving procedures. In: Proc. 3rd ACM STOC, ACM 1971, pp. 151-158.
9. [CK98] P. Crescenzi, V. Kann: A compendium of NP optimization problems. http: //www.nada.kth. se/theory/compendium/
10. [CLR90] T. H. Cormen, C. E. Leiserson, R. L. Rivest: Introduction to algorithms. MIT Press, 1990.
11. [En99] L. Engebretsen: An explicit lower bound for TSP with distances one and two. Extended abstract in: Proc. STACS'99, LNCS 1563, Springer 1999, pp. 373-382. Full version in: Electronic Colloquium on Computational Complexity, Report TR98-046 (1999).
12. [GJ79] M. R. Garey, D. S. Johnson: Computers and vIntractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, 1979.
13. [Hå97] J. Håstad: Some optimal inapproximability results. Extended abstract in: Proc. 29th ACM STOC, ACM 1997, pp. 1-10. Full version in: Electronic Colloquium on Computational Complexity, Report TR97-037, (1999).
14. [Ho96] D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.
15. [Hr98] J. Hromkovič: Stability of approximation algorithms and the knapsack problem. Unpublished manuscript, RWTH Aachen, 1998.
16. [IK75] O. H. Ibarra, C. E. Kim: Fast approximation algorithms for the knapsack and sum of subsets problem. J. of the ACM 22 (1975), pp. 463-468.
17. [Jo74] D. S. Johnson: Approximation algorithms for combinatorial problems. JCSS 9 (1974), pp. 256-278.
18. [Lo75] L. Lovász: On the ratio of the optimal integral and functional covers. Discrete Mathematics 13 (1975), pp. 383-390.
19. [LLRS85] E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (Eds.): The Traveling Salesman Problem. John Wiley & Sons, 1985.
20. [Mi96] I. S. B. Mitchell: Guillotine subdivisions approximate polygonal subdivisions: Part II - a simple polynomial-time approximation scheme for geometric fc-MST, TSP and related problems. Technical Report, Dept, of Applied Mathematics and Statistics, Stony Brook 1996.
21. [MPS98] E. W. Mayr, H. J. Prömel, A. Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. LNCS 1967, Springer 1998.
22. [Pa77] Ch. Papadimitriou: The Euclidean traveling salesman problem is NP- complete. Theoretical Computer Science 4 (1977), pp. 237-244.
23. [Pa94] Ch. Papadimitriou: Computational Complexity, Addison-Wesley 1994.
24. [PY93] Ch. Papadimitriou, M. Yannakakis: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993), 1-11.