Abstract
A large fraction of the theory of approximation algorithms, as we know it today, is built around linear programming (LP). In Section 12.1 we will review some key concepts from this theory. In Section 12.2 we will show how the LP-duality theorem gives rise to min-max relations which have far-reaching algorithmic significance. Finally, in Section 12.3 we introduce the two fundamental algorithm design techniques of rounding and the primal-dual schema, as well as the method of dual fitting, which yield all the algorithms of Part II of this book.
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
V. Chvâtal. Linear Programming. W.H. Freeman and Co., New York, NY, 1983. (Cited on p. 107)
G.B. Dantzig. Linear Programming and Extensions. Reprint of the 1968 corrected edition. Princeton University Press, Princeton, NJ, 1998. (Cited on p. 107)
H. Karloff. Linear Programming. Birkhäuser, Boston, MA, 1991. (Cited on p. 107)
G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, NY, 1988. (Cited on p. 107)
A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY, 1986. (Cited on p. 107)
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, New Jersey, 1993. (Cited on p. 107)
W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. John Wiley & Sons, New York, NY, 1998. (Cited on p. 107)
M. Grötschel, L. Lov sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Second edition. Springer-Verlag, Berlin, 1993. ( Cited on p. 107 )
L. Lovâsz. Combinatorial Problems and Exercises. Second edition. North-Holland, Amsterdam—New York, 1993. (Cited on pp. 107, 339, 341 )
L. Lovâsz and M.D. Plummer. Matching Theory. North-Holland, Amsterdam—New York, 1986. (Cited on pp. 8, 11, 107 )
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982. (Cited on pp. 11, 107 )
L. Lovâsz and M.D. Plummer. Matching Theory. North-Holland, Amsterdam—New York, 1986. (Cited on pp. 8, 11, 107 )
M. Grötschel, L. Lovész, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica,1:169–197, 1981. (Cited on p. 107)
M. Grötschel, L. Lov sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Second edition. Springer-Verlag, Berlin, 1993. ( Cited on p. 107 )
A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY, 1986. (Cited on p. 107)
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 to LP-Duality. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive