Abstract
NP-hard optimization problems exhibit a rich set of possibilities, all the way from allowing approximability to any required degree, to essentially not allowing approximability at all. Despite this diversity, underlying the process of design of approximation algorithms are some common principles. We will explore these in the current chapter.
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.
Notes
J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17: 449–467, 1965.
S.A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.
L.A. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115–116, 1973. English translation in Problems of Information Transmission 9: 265–266.
R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, NY, 1972.
V.G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Analiz., 3: 25–30, 1964 (in Russian).
R.L. Graham. Bounds for certain multiprocessing anomalies Bell System Technical Journal, 45: 1563–1581, 1966.
P. Erdös. Grâfok pá.ros körüljárisn részgráfjairôl (On bipartite subgraphs of graphs, in Hungarian). Mat. Lapok, 18:283–288, 1967.
M.R. Garey, R.L. Graham, and J.D. Ullman. An analysis of some packing algorithms. In Combinatorial Algorithms (Courant Computer Science Symposium, No. 9), pages 39–47, 1972.
D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9: 256–278, 1974.
L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13: 383–390, 1975.
M.O. Rabin. Probabilistic algorithms. In J.F. Traub, editor, Algorithms and Complexity, Recent Results and New Directions, pages 21–39. Academic Press, New York, NY, 1976.
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. Second edition. MIT Press and McGraw-Hill, 2001.
R. Courant and H. Robbins. What Is Mathematics? Oxford University Press, New York, NY, 1941.
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.
L. Lovâsz and M.D. Plummer. Matching Theory. North-Holland, Amsterdam—New York, 1986.
D.S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA, 1997.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag, Berlin, 1999.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Introduction. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive