Abstract
One can try to parametrize the set of the instances of an optimization problem and look for in polynomial time achievable approximation ratio with respect to this parametrization. When the approximation ratio grows with the parameter, but is independent of the size of the instances,then we speak about stable approximation algorithms. An interesting point is that there exist stable approximation algorithms for problems like TSP that is not approximable within any polynomial approximation ratio in polynomial time (assuming P is not equal to NP).The investigation of the stability of approximation overcomes in this way the troubles with measuring the complexity and approximation ratio in the worst-case manner, because it may success in partitioning of the set of all input instances of a hard problem into infinite many classes with respect to the hardest of the particular inputs. We believe that approaches like this will become the core of the algorithmics,because they provide a deeper insight in the hardness of specific problems and in many application we are not interested in the worst-case problem hardness, but in the hardness of forthcoming problem instances.
Chapter PDF
References
S. Arora: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 37th IEEE FOCS, IEEE 1996, pp. 2–11.
S. Arora: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE FOCS, IEEE 1997, pp. 554–563.
D. P. Bovet, C. Crescenzi: Introduction to the Theory of Complexity, Prentice-Hall 1993.
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, Pittsbourgh, 1976.
S. A. Cook: The complexity of theorem proving procedures. In: Proc 3rd ACM STOC, ACM 1971, pp. 151–158.
M. R. Garey, D. S. Johnson: Computers and Intractibility. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, 1979.
D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.
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.
R. M. Karp: Reducibility among combinatorial problems. In: R. E. Miller, J. W. Thatcher (eds.): Complexity of Computer Computations, Plenum Press 1972, pp. 85–103.
L. Lovasz: On the ratio of the optimal integral and functional covers. Discrete Mathematics 13 (1975), pp. 383–390.
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. Promel, A. Steger (Eds.): Lecture on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science 1967, Springer 1998.
Ch. Papadimitriou: The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), pp. 237–244.
Ch. Papadimitriou: Computational Complexity, Addison-Wesley 1994.
I. Wegener: Theoretische Informatik: eine algorithmenorientierte Einfuhrung. B. G. Teubner 1993.
J. Hromkovič: Theoretical Computer Science, Springer-Verlag 2004.
H.-J. Böckenhauer, D. Bongartz, J. Hromkovič R. Klasing, G. Proietti, S. Seibert, W. Unger: On the Hardness of constructing mininal 2-connected spanning subgraphs in complete graphs with sharped triangle inequality. In: Proc FSTTCS?02, pp.59–70.
J. Hromkovič: Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer-Verlag 2003.
V. V. Vazirani: Approximation Algorithms. Springer-Verlag 2003.
R. G. Downey, M. R. Fellows: Fixed-parameter tractibility and completeness I: Basic Results. SIAM Journal of Computing. 24 (1995), pp. 873–921.
R. G. Downey, M. R. Fellows: Parametrized Complexity. Springer-Verlag 1999.
L. Forlizzi, J. Hromkovič G. Proietti, S. Seibert: On the stability of approximation for Hamiltonian path problems. Unpublished manuscript.
H.-J. Böckenhauer, J. Hromkovič R. Klasing, S. Seibert, W. Unger: Approximation algorithms for TSP with sharped triangle inequality. Information Processing Letters. 75 (2000), pp. 133–138.
H.-J. Böckenhauer, S. Seibert: Improved lower bounds on the approximability of the traveling salesman problem. Theoretical Informatics and Applications. 34 (2000), pp.213–255.
T. Andreae, H. J. Bandelt: Performance guarentees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal on Discrete Mathematics. 8(1), pp. 1–16, February 1995.
M. Bender, C. Chekuri: Performance guarentees for TSP with a parametrized triangle inequality. In: Proc. 6. International Workshop on Algorithms and Data Structures, WADS?99, volume 1663 Lecture Notes in Computer Science. pp. 1–16, Springer, August 1999.
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(1), pp. 3–24, July 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Hromkovič, J. (2004). Stability of Approximation in Discrete Optimization. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_2
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive