Advertisement

Hardness of Approximation

  • Vijay V. Vazirani

Abstract

A remarkable achievement of the theory of exact algorithms is that it has provided a fairly complete characterization1 of the intrinsic complexity of natural computational problems, modulo some strongly believed conjectures. Recent impressive developments raise hopes that we will some day have a comprehensive understanding of the approximability of NP-hard optimization problems as well. In this chapter we will give a brief overview of these developments.

Keywords

Steiner Tree Vertex Cover Proof System Boolean Variable Truth Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 88.
    U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 2–12, 1991.CrossRefGoogle Scholar
  2. 19.
    L. Babai. Trading group theory for randomness. In Proc. 17th ACM Symposium on the Theory of Computing, pages 421–429, 1985.Google Scholar
  3. 115.
    S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proofs. SIAM Journal on Computing, 18: 186–208, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 29.
    M. Blum and S. Kannan. Designing programs that check their work. In Proc. 21st ACM Symposium on the Theory of Computing, pages 86–97, 1989.Google Scholar
  5. 30.
    M. Blum, M. Luby, and R. Rubinfeld. Testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47: 549–595, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  6. 15.
    S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pages 2–13, 1992.CrossRefGoogle Scholar
  7. 13.
    S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pages 13–22, 1992.Google Scholar
  8. 129.
    J. Hastad. Some optimal inapproximability results. In Proc. 29th ACM Symposium on the Theory of Computing, pages 1–10, 1997.Google Scholar
  9. 226.
    C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43: 425–440, 1991.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 26.
    M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, 32: 171–176, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  11. 204.
    A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8: 261–277, 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 142.
    R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proc. 30st IEEE Annual Symposium on Foundations of Computer Science, pages 248–253, 1989.CrossRefGoogle Scholar
  13. 88.
    U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 2–12, 1991.CrossRefGoogle Scholar
  14. 128.
    J. Hastad. Clique is hard to approximate within n1-E. In Proc. 37th IEEE Annual Symposium on Foundations of Computer Science, pages 627–636, 1996.Google Scholar
  15. 31.
    R. Boppana and M.M. Halldôrsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32: 180–196, 1992.MathSciNetzbMATHCrossRefGoogle Scholar
  16. 206.
    C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41: 960–981, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  17. 86.
    U. Feige. A treshold of In n for approximating set cover. Journal of the ACM, 45: 634–652, 1998.MathSciNetzbMATHCrossRefGoogle Scholar
  18. 25.
    M. Ben-or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability. In Proc. 20th ACM Symposium on the Theory of Computing, pages 113–131, 1988.Google Scholar
  19. 239.
    R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27: 763803, 1998.Google Scholar
  20. 240.
    S.K. Sahni and T.F. Gonzalez. P-complete approximation problems. Journal of the ACM, 23: 555–565, 1976.zbMATHCrossRefGoogle Scholar
  21. 219.
    M. Naor, L. Schulman, and A. Srinivasan. Splitters and near-optimal de-randomization. In Proc. 36th IEEE Annual Symposium on Foundations of Computer Science, pages 182–191, 1995.Google Scholar
  22. 169.
    H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX-3SAT? In Proc. 38th IEEE Annual Symposium on Foundations of Computer Science, pages 406–415, 1997.CrossRefGoogle Scholar
  23. 12.
    S. Arora and C. Lund. Hardness of approximations. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46–93. PWS Publishing, Boston, MA, 1997.Google Scholar
  24. 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