Skip to main content
SpringerLink
Log in

Recent developments on the approximability of combinatorial problems

  • Session 9 Invited Paper
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

Abstract

Research during the last few years is finally succeeding in shedding light on the limitations in the approximation of many important combinatorial optimization problems. The talk will survey the approximability picture that has emerged so far. In the paper we give a brief summary.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arora, L. Babai, J. Stern, Z. Sweedyk, “The Hardness of Approximating Problems Defined by Linear Constraints”, Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993.

    Google Scholar 

  2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, “Proof Verification and Hardness of Approximation Problems”, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 14–23, 1992.

    Google Scholar 

  3. S. Arora, S. Safra, “Probabilistic Checking of Proofs”, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 2–13, 1992.

    Google Scholar 

  4. G. Ausiello, A. Marchetti-Spaccamela, M. Protasi, “Toward a Unified Approach for the Classification of NP-complete Optimization Problems”, Theoretical Computer Science 12, 83–96, 1980.

    Article  Google Scholar 

  5. G. Ausiello, A. D'Atri, M. Protasi, “Structure Preserving Reductions Among Convex Optimization Problems”, J. Comp. Sys. Sci. 21, 136–153, 1980.

    Article  Google Scholar 

  6. L. Babai, “Transparent Proofs and Limits to Approximation”, manuscript, 1993.

    Google Scholar 

  7. L.Babai, L. Fortnow, C. Lund, “Nondeterministic Exponential Time has Two-Prover Interactive Protocols”, Computational Complexity 1, 3–40, 1991.

    Article  Google Scholar 

  8. M. Bellare, “Interactive Proofs and Approximation: Reductions from Two Provers in One Round”, Proc. 2nd Israel Symp. on Theory and Computing Sys., 266–274, 1993.

    Google Scholar 

  9. M. Bellare, S. Goldwasser, C. Lund, A. Russel, “Efficient Probabilistically Checkable Proofs and Applications to Approximation”, Proc. 25th ACM Symp. on Theory of Computing, 294–304, 1993.

    Google Scholar 

  10. M. Bellare, P. Rogoway, “The Complexity of Approximating a Nonlinear Program”, in Complexity in Numerical Optimization, P. Pardalos ed., World-Scientific, 1993.

    Google Scholar 

  11. P. Berman, G. Schnitger, “On the Complexity of Approximating the Independent Set Problem”, Information and Computation 96, 77–94, 1992.

    Article  Google Scholar 

  12. M. Bern, P. Plassman, “The Steiner Problem with Edge Lengths 1 and 2”, Information Processing Letters, 32, 171–176, 1989.

    Article  Google Scholar 

  13. A. Blum, “Some Tools for Approximate 3-coloring”, Proc. 30th IEEE Symp. on Foundations of Computer Science, 554–562, 1990.

    Google Scholar 

  14. A. Blum, T. Jiang, M. Li, J. Tromp, M. Yannakakis, “Linear Approximation of Shortest Superstrings”, Proc. 23rd ACM Symp. on Theory of Computing, 328–336, 1991.

    Google Scholar 

  15. N. Christofides, “Worst-case Analysis of New Heuristics For the Traveling Salesman Problem”, Technical Report, GSIA, Carnegie-Mellon, 1976.

    Google Scholar 

  16. E.G. Coffman Jr., M. R. Garey, D. S. Johnson, “Approximation Algorithms for Bin Packing — An Updated Survey”, in Algorithm Design and Computer System Design, G. Ausiello, M. Lucerini, P. Serafini (eds.), 49–106, Springer Verlag, 1984.

    Google Scholar 

  17. S. A. Cook, “The Complexity of Theorem Proving Procedures”, Proc. 3rd Annual ACM Symp. on Theory of Computing, 151–158, 1971.

    Google Scholar 

  18. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour, M. Yannakakis, “The Complexity of Multiway Cuts”, Proc. 24th Annual ACM Symp. on Theory of Computing, 1992.

    Google Scholar 

  19. R. Fagin, “Generalized First-Order Spectra, and Polynomial-time Recognizable Sets”, in R. Karp (ed.), Complexity of Computations, AMS, 1974.

    Google Scholar 

  20. U. Feige, J. Kilian, “Two Prover Protocols — Low Error at Affordable Rate”, in preparation.

    Google Scholar 

  21. U. Feige, L. Lovasz, “Two-prover One-round Proof Systems: Their Power and Their Problems”, Proc. 24th Annual ACM Symp. on Theory of Computing, 733–744, 1992.

    Google Scholar 

  22. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, M. Szegedy, “Approximating Clique is Almost NP-complete”, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 2–12, 1991.

    Google Scholar 

  23. M. R. Garey, D. S. Johnson, “The Complexity of Near-optimal Graph Coloring”, J.ACM 23, 43–49, 1976.

    Article  Google Scholar 

  24. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.

    Google Scholar 

  25. O. H. Ibarra, C. E. Kim, “Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems”, J.ACM 22, 463–468, 1975.

    Article  Google Scholar 

  26. R. W. Irving, “On Approximating the Minimum Independent Dominating Set”, Information Processing Letters 37, 197–200, 1991.

    Article  Google Scholar 

  27. D. S. Johnson, “Approximation Algorithms for Combinatorial Problems”, J. Comp. Sys. Sc. 9, 256–278, 1974.

    Google Scholar 

  28. D. S. Johnson, “Worst Case Behavior of Graph Coloring Algorithms”, Proc. 5th Conf. on Combinatorics, Graph Theory and Computing, 513–527, 1974.

    Google Scholar 

  29. D. S. Johnson, “The NP-completeness Column: An Ongoing Guide”, J. of Algorithms 13, 502–524, 1992.

    Article  Google Scholar 

  30. V. Kann, “On the Approximability of NP-complete Optimization Problems”, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.

    Google Scholar 

  31. R. M. Karp, “Reducibility among Combinatorial Problems”, in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 85–103, 1972.

    Google Scholar 

  32. S. Khanna, N. Linial, S. Safra, “On the Hardness of Approximating the Chromatic Number”, Proc. 2nd Israel Symp. on Theory and Computing Sys., 250–260, 1993.

    Google Scholar 

  33. D. Karger, R. Motwani, G.D.S. Ramkumar, “On Approximating the Longest Path in a Graph”, Proc. Workshop on Discrete Algorithms and Structures, 1993.

    Google Scholar 

  34. P. G. Kolaitis, M. N. Thakur, “Approximation Properties of NP Minimization Classes”, Proc. 6th Conf. on Structures in Computer Science, 353–366, 1991.

    Google Scholar 

  35. D. Lapidot, A. Shamir, “Fully Parallelized Multiprover Protocols for NEXP-TIME”, Proc. 32nd Annual IEEE Symp. on Foundations of Computer Science, 13–18, 1991.

    Google Scholar 

  36. C. Lund, M. Yannakakis, “On the Hardness of Approximating Minimization Problems”, Proc. 25th ACM Symp. on Theory of Computing, 286–293, 1993.

    Google Scholar 

  37. C. Lund, M. Yannakakis, “The Approximation of Maximum Subgraph Problems”, Proc. 20th Intl. Coll. on Automata, Languages and Programming, 40–51, 1993.

    Google Scholar 

  38. A. Panconesi, D. Ranjan, “Quantifiers and Approximation”, Proc. 22nd ACM Symp. They of Computing, 446–456, 1990.

    Google Scholar 

  39. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1993.

    Google Scholar 

  40. C. H. Papadimitriou, M. Yannakakis, “Optimization, Approximation and Complexity Classes”, J. Computer and System Sci. 43, 425–440, 1991.

    Article  Google Scholar 

  41. C. H. Papadimitriou, M. Yannakakis, “The Traveling Salesman Problem with Distances One and Two”, Mathematics of Operations Research 18, 1–11, 1993.

    Google Scholar 

  42. A. Paz, S. Moran, “Non Deterministic Polynomial Optimization Problems and their Approximation”, Theoretical Computer Science 15, 251–277, 1981.

    Article  Google Scholar 

  43. S. Sahni, “Approximate Algorithms for the 0/1 Knapsack Problem”, J.ACM 22, 115–124, 1975.

    Article  Google Scholar 

  44. S. Sahni, T. Gonzalez, “P-complete Approximation Problems”, J. ACM 23, 555–565, 1976.

    Article  Google Scholar 

  45. H. U. Simon, “On Approximate Solutions for Combinatorial Optimization Problems”, SIAM J. Disc. Math. 3, 294–310, 1990.

    Article  Google Scholar 

  46. M. Yannakakis, “The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems”, J.ACM 26, 618–630, 1979.

    Article  Google Scholar 

  47. M. Yannakakis, “On the Approximation of Maximum Satisfiability”, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1–9, 1992.

    Google Scholar 

  48. D. Zuckerman, “NP-complete Problems Have a Version That's Hard to Approximate”, Proc. 8lh Conf. on Structure in Complexity Theory, 305–312, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 07974, Murray Hill, NJ

    Mihalis Yannakakis

Authors
  1. Mihalis Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yannakakis, M. (1993). Recent developments on the approximability of combinatorial problems. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_267

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_267

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation