• Vijay V. Vazirani


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [75]
    J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17: 449–467, 1965.MathSciNetCrossRefGoogle Scholar
  2. [53]
    S.A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.Google Scholar
  3. [193]
    L.A. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115–116, 1973. English translation in Problems of Information Transmission 9: 265–266.Google Scholar
  4. [171]
    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.CrossRefGoogle Scholar
  5. [263]
    V.G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Analiz., 3: 25–30, 1964 (in Russian).MathSciNetGoogle Scholar
  6. [119]
    R.L. Graham. Bounds for certain multiprocessing anomalies Bell System Technical Journal, 45: 1563–1581, 1966.CrossRefGoogle Scholar
  7. [79]
    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.Google Scholar
  8. [97]
    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.Google Scholar
  9. [157]
    D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9: 256–278, 1974.MathSciNetCrossRefGoogle Scholar
  10. [199]
    L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13: 383–390, 1975.MathSciNetCrossRefGoogle Scholar
  11. [232]
    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.Google Scholar
  12. [225]
    C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.zbMATHGoogle Scholar
  13. [56]
    T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. Second edition. MIT Press and McGraw-Hill, 2001.zbMATHGoogle Scholar
  14. 57.
    R. Courant and H. Robbins. What Is Mathematics? Oxford University Press, New York, NY, 1941.zbMATHGoogle Scholar
  15. [225]
    C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.zbMATHGoogle Scholar
  16. [254]
    R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.Google Scholar
  17. [202]
    L. Lovâsz and M.D. Plummer. Matching Theory. North-Holland, Amsterdam—New York, 1986.zbMATHGoogle Scholar
  18. [133]
    D.S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA, 1997.zbMATHGoogle Scholar
  19. [18]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations