Abstract
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].
Supported by DFG Project HR 14/5-1 “Zur Klassifizierung der Klasse praktisch lösbarer algorithmischer Aufgaben”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Arora: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE FOCS, 1997, pp. 554–563.
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.
T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discr. Math. 8 (1995), pp. 1–16.
D. P. Bovet, P. Crescenzi: Introduction to the Theory of Complexity, Prentice-Hall 1993.
M. A. Bender, C. Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. In: Proc. WADS’99, LNCS, to appear.
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.
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.
S. A. Cook: The complexity of theorem proving procedures. In: Proc. 3rd ACM STOC, ACM 1971, pp. 151–158.
P. Crescenzi, V. Kann: A compendium of NP optimization problems. http://www.nada.kth.se/theory/compendium/
T. H. Cormen, C. E. Leiserson, R. L. Rivest: Introduction to algorithms. MIT Press, 1990.
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).
M. R. Garey, D. S. Johnson: Computers and vIntractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, 1979.
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).
D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.
J. Hromkovič: Stability of approximation algorithms and the knapsack problem. Unpublished manuscript, RWTH Aachen, 1998.
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.
D. S. Johnson: Approximation algorithms for combinatorial problems. JCSS 9 (1974), pp. 256–278.
L. Lovász: On the ratio of the optimal integral and functional covers. Discrete Mathematics 13 (1975), pp. 383–390.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (Eds.): The Traveling Salesman Problem. John Wiley & Sons, 1985.
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.
E.W. Mayr, H. J. Prömel, A. Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. LNCS 1967, Springer 1998.
Ch. Papadimitriou: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), pp. 237–244.
Ch. Papadimitriou: Computational Complexity, Addison-Wesley 1994.
Ch. Papadimitriou, M. Yannakakis: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993), 1–11.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böckenhauer, HJ., Hromkovič, J., Klasing, R., Seibert, S., Unger, W. (2000). Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive