Skip to main content
SpringerLink
Log in

Some open problems in approximation

  • Invited Presentations
  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1994)

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

Included in the following conference series:

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, 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 

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

    Google Scholar 

  3. 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.

    Google Scholar 

  4. G. Ausiello, A. D'Atri, M. Protasi, “Structure Preserving Reductions Among Convex Optimization Problems”, J. Computer and System Sci. 21, 136–153, 1980.

    Google Scholar 

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

    Google Scholar 

  6. R. Bar-Yehuda, S. Even, “A Linear Time Approximation Algorithm for the Weighted Vertex Cover Problem”, J. Algorithms 2, 198–203, 1981.

    Google Scholar 

  7. 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 

  8. M. Bellare, P. Rogoway, “The Complexity of Approximating a Nonlinear Program”, in Complexity in Numerical Optimization, P. Pardalos ed., WorldScientific, 1993.

    Google Scholar 

  9. M. Bellare, M. Sudan, “Improved Non-Approximability Results”, draft, Nov. 1993.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  14. P. Crescenzi, A. Panconesi, “Completeness in Approximation Classes”, Information and Computation 93, 241–262, 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. 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 

  17. U. Feige, J. Kilian, “Two Prover Protocols — Low Error at Affordable Rate”, draft, Oct. 1993.

    Google Scholar 

  18. 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 

  19. 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 

  20. A. M. Frieze, G. Galbiati, F. Maffioli, “On the Worst-case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem”, Networks 12, 23–39, 1982.

    Google Scholar 

  21. N. Garg, V. V. Vazirani, M. Yannakakis, “Approximate Max-Flow Min-(Multi)cut Theorems and Their Applications”, Proc. 25th Annual ACM Symp. on Theory of Computing, pp. 698–707, 1992.

    Google Scholar 

  22. M. X. Goemans, D. P. Williamson, “A New 3/4 Approximation Algorithm for MAX SAT”, Proc. 3rd Conf. on Integer Programming and Combinatorial Optimization, 1993.

    Google Scholar 

  23. M. X. Goemans, D. P. Williamson, “.878 Approximation Algorithms for MAX CUT and MAX 2SAT”, draft, Nov. 1993.

    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. D. Gusfield, L. Pitt, “Equivalent Approximation Algorithms for Node Cover”, Information Processing Letters 22, 291–294, 1986.

    Google Scholar 

  26. M. Held, R. M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees”, Operations Research 18, 1138–1162, 1970.

    Google Scholar 

  27. D. S. Hochbaum, “Efficient Bounds for the Stable Set, Vertex Cover, and Set Packing Problems”, Discrete Applied Mathematics 6, 243–254, 1982.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  33. 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 

  34. P. Klein, A. Agrawal, R. Ravi, S. Rao, “Approximation Through Multicommodity Flow”, Proc. 31st Annual IEEE Symp. on Foundations of Computer Science, 726–737, 1990.

    Google Scholar 

  35. 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 

  36. S. Khanna, R. Motwani, M. Sudan, U. Vazirani, “On Syntactic versus Computational Views of Approximation”, draft, Nov. 1993.

    Google Scholar 

  37. 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 

  38. 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 

  39. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys, The Traveling Salesman Problem, J. Wiley & Sons, 1985.

    Google Scholar 

  40. F. T. Leighton, S. Rao, “An Approximate Max-flow Min-cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms”, Proc. 28th Annual IEEE Symp. on Foundations of Computer Science, 256–269, 1988. Full (unpublished) version has additional results.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  48. S. Plotkin, E. Tardos, “Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flow Problems”, Proc. 25th Annual ACM Symp. on Theory of Computing, 691–697, 1993.

    Google Scholar 

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

    Google Scholar 

  50. C. Savage, “Depth-first Search and the Vertex Cover Problem”, Information Processing Letters 14, 233–235, 1982.

    Google Scholar 

  51. D. B. Shmoys, D. P. Williamson, “Analyzing the Held-Karp TSP bound: A Monotonicity Property with Application”, Information Processing Letters 35, 281–285, 1990.

    Google Scholar 

  52. D. P. Williamson, “Analysis of the Held-Karp Lower Bound for the Assymetric TSP”, Operations Research Letters 12, 83–88, 1992.

    Google Scholar 

  53. L. A. Wolsey, “Heuristic Analysis, Linear Programming and Branch and Bound”, Mathematical Programming Study 13, 121–134, 1980.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  56. D. Zuckerman, “NP-complete Problems Have a Version That's Hard to Approximate”, Proc. 8th 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

M. Bonuccelli P. Crescenzi R. Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yannakakis, M. (1994). Some open problems in approximation. In: Bonuccelli, M., Crescenzi, P., Petreschi, R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57811-0_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-57811-0_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57811-6

  • Online ISBN: 978-3-540-48337-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation