Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
The investigation of the possibility to efficiently compute approximations of hard optimization problems is one of the central and most fruitful areas of current algorithm and complexity theory. The aim of this paper is twofold. First, we introduce the notion of stability of approximation algorithms. This notion is shown to be of practical as well as of theoretical importance, especially for the real understanding of the applicability of approximation algorithms and for the determination of the border between easy instances and hard instances of optimization problems that do not admit any polynomial-time approximation.
Secondly, we apply our concept to the study of the traveling salesman problem. We show how to modify the Christofides algorithm for Δ-TSP to obtain efficient approximation algorithms with constant approximation ratio for every instance of TSP that violates the triangle inequality by a multiplicative constant factor. This improves the result of Andreae and Bandelt [AB95].
KeywordsStability of approximation Traveling Salesman Problem
Unable to display preview. Download preview PDF.
- [Ar97]S. Arora: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE FOCS, 1997, pp. 554–563.Google Scholar
- [BC93]D. P. Bovet, P. Crescenzi: Introduction to the Theory of Complexity, Prentice-Hall 1993.Google Scholar
- [BC99]M. A. Bender, C. Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. In: Proc. WADS’99, LNCS, to appear.Google Scholar
- [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.Google Scholar
- [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.Google Scholar
- [Co71]S. A. Cook: The complexity of theorem proving procedures. In: Proc. 3rd ACM STOC, ACM 1971, pp. 151–158.Google Scholar
- [CK98]P. Crescenzi, V. Kann: A compendium of NP optimization problems. http://www.nada.kth.se/theory/compendium/
- [CLR90]T. H. Cormen, C. E. Leiserson, R. L. Rivest: Introduction to algorithms. MIT Press, 1990.Google Scholar
- [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).Google Scholar
- [GJ79]M. R. Garey, D. S. Johnson: Computers and vIntractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, 1979.Google Scholar
- [Håa97]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).Google Scholar
- [Ho96]D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.Google Scholar
- [Hr98]J. Hromkovič: Stability of approximation algorithms and the knapsack problem. Unpublished manuscript, RWTH Aachen, 1998.Google Scholar
- [LLRS85]E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (Eds.): The Traveling Salesman Problem. John Wiley & Sons, 1985.Google Scholar
- [Mi96]I. S. B. Mitchell: Guillotine subdivisions approximate polygonal subdivisions: Part II — a simple polynomial-time approximation scheme for geometric k-MST, TSP and related problems. Technical Report, Dept. of Applied Mathematics and Statistics, Stony Brook 1996.Google Scholar
- [Pa94]Ch. Papadimitriou: Computational Complexity, Addison-Wesley 1994.Google Scholar