Improved Approximation Algorithms for Maximum Cut and Satisflability Problems Using Semidefinite Programming

Journal of the ACM (JACM)

Volumn 42, Issue 6, 1995, Pages 1115-1145

  Goemans, Michel X ^a   Williamson, David P ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; convex optimization; randomized algorithms; satisfiability

Indexed keywords

EID: 84893574327     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/227683.227684     Document Type: Article

References (67)

1. Alizadeh, F. 1995. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimiz. 5, 13–51.
2. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. 1992. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 14–23.
3. Bar-Yehuda, R., and Even, S. 1981. A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2, 198–203.
4. Barahona, F., Grotschel, M., Junger, M., and Reinelt, G. 1988. An application of combinatorial optimization to statistical physics and circuit layout design. Open Res. 36, 493–513.
5. Barvinok, A. I. 1995. Problems of distance geometry and convex properties of quadratic maps. Disc. Computat Geom. 13, 189–202.
6. Bellare, M., Goldreich, O., and Sudan, M. 1995. Free bits, PCP and non-approximability—Towards tight results. In Proceedings of the 36 th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos, Calif., pp. 422–431.
7. Berger, M. 1987. Geometry II. Springer-Verlag, Berlin.
8. Bondy, J. A., and Murty, U. S. R. 1976. Graph Theory with Applications. American Elsevier Publishing, New York, N.Y.
9. Boyd, S., El Ghaoui, L., Feron, E., and Balakrishnan, V. 1994. Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia, Pa.
10. Chor, B., and Sudan, M. 1995. A geometric approach to betweenness. In Algorithms-ESA '95, P. Spirakis, ed. Lecture Notes in Computer Science, vol. 979. Springer-Verlag, New York, pp. 227–237.
11. Christensen, J., and Vesterstrom, J. 1979. A note on extreme positive definite matrices. Math. Annalen, 244:65-68.
12. Delorme, C., and Poljak, S. 1993a. Combinatorial properties and the complexity of a max-cut approximation. Europ. J. Combinat. 14, 313–333.
13. Delorme, C., and Poljak, S. 1993b. Laplacian eigenvalues and the maximum cut problem. Math. Prog. 62, 557–574.
14. Delorme, C., and Poljak, S. 1993c. The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Disc. Math. Ill, 145–156.
15. Euler, L. 1781. De mensura angulorum solidorum. Petersburg.
16. Feigf. U., and Goemans, M. X. 1995. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems. IEEE Computer Society Press, Los Alamitos, Calif., pp. 182–189.
17. Feige, U., and Lovicksz L. 1992. Two-prover one-round proof svstems: Their power and their problems. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, S.C., Canada, May 4–6). ACM, New York, pp. 733–744.
18. Frieze, A., and Jerrum, M. 1996. Improved approximation algorithms for MAX K-CUT and MAX BISECTION. Algorithmica, to appear.
19. Garey, M., Johnson, D., and Stockmeyer, L. 1976. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237–267.
20. Girard, A. 1629. De la mesure de la superficie des triangles et polygones spheriques. Appendix to “Invention nouvelle en l'algebre”. Amsterdam.
21. Goemans, M. X., and Williamson, D. P. 1994a. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (Montreal, Que., Canada, May 23–25). ACM, New York, pp. 422–431.
22. Goemans, M. X., and Williamson, D. P. 1994b. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM J. Disc. Math. 7, 656–666.
23. Golub, G. H., and van Loan, C. F. 1983. Matrix Computations. The Johns Hopkins University Press, Baltimore, Md.
24. Grone, R., Pierce, S., and Watkins, W. 1990. Extremal correlation matrices. Lin. Algebra Appl 134, 63–70.
25. Grotschel, M., Lovasz, L., and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197.
26. Grotschel, M., Lovasz L., and Schrijver, A. 1988.Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin.
27. Had Lock, F. 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4, 221–225.
28. Haglin, D. J. 1992. Approximating maximum 2-CNF satisfiability. Paral Proc. Lett. 2,181-187.
29. Haglin, D. J., and Venkatesan, S. M. 1991. Approximation and intractability results for the maximum cut problem and its variants. IEEE Trans. Comput. 40, 110–113.
30. Hochbaum, D. S. 1982. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 555–556.
31. Hofmeister, T., and Lefmann, H. 1995. A combinatorial design approach to MAXCUT. In Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science. To appear.
32. Homer, S., and Peinado, ML A highly parallel implementation of the Goemans/Williamson algorithm to approximate MaxCut. Manuscript.
33. Karger, D., Motwani, R., and Sudan, M. 1994. Approximate graph coloring by semidefinite programming. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 2–13.
34. Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. Miller and J. Thatcher, eds. Plenum Press, New York, pp. 85–103.
35. Knuth, D. E. 1981. Seminumerical Algorithms. Vol. 2 of The Art of Computer Programming. Addison-Wesley, Reading, Mass.
36. Lancaster, P., and Tismenetsky, M. 1985. The Theory of Matrices. Academic Press, Orlando, Fla.
37. Laurent, M., and Pouak, S. 1996. On the facial structure of the set of correlation matrices. SIAM J. Matrix Anal, and Appl. to appear.
38. Li, C.-K., AND Tam, B.-S. 1994. A note on extreme correlation matrices. SIAM J. Matrix Anal. and Appl. 15, 903–908.
39. Loewy, R. 1980. Extreme points of a convex subset of the cone of positive definite matrices. Math. Annalen. 253, 227–232.
40. Lovasz, L. 1979. On the Shannon capacity of a graph. IEEE Trans. Inf Theory IT-25, 1–7.
41. Lovasz, L. 1983. Self-dual polytopes and the chromatic number of distance graphs on the sphere. Acta Sci. Math. 45, 317–323.
42. Lovasz, L. 1992. Combinatorial optimization: Some problems and trends. DIMACS Technical Report 92–153.
43. Lovasz, L., and Schrijver, A. 1989. Matrix cones, projection representations, and stable set polyhedra. In Polyhedral Combinatorics, vol. 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, R.I.
44. Lovasz, L., and Schrijver, A. 1990. Cones of matrices and setfunctions, and 0–1 optimization. SIAM J. Optimiz. 1, 166–190.
45. Mahajan, S., and Ramesh, H. 1995. Derandomizing semidefinite programming based approximation algorithms. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos, Calif., pp. 162–163.
46. Mohar, B., and Pouak, S. 1993. Eigenvalue methods in combinatorial optimization. In Combinatorial and Graph-Theoretic Problems in Linear Algebra, vol. 50 of The IMA Volumes in Mathematics and Its Applications. R. Brualdi, S. Friedland, and V. Klee, eds. Springer-Verlag, New York.
47. Nesterov, Y., and Nemirovskii, A. 1989. Self-Concordant Functions and Polynomial Time Methods in Convex Programming. Central Economic and Mathematical Institute, Academy of Science, Moscow, CIS.
48. Nesterov, Y., and Nemirovskii, A. 1994. Interior Point Polynomial Methods Jn Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia, Pa.
49. Orlova, G. I., and Dorfman, Y. G. 1972. Finding the maximal cut in a graph. Eng. Cyber. 10, 502–506.
50. Overton, M. L., and Womersley, R. S. 1992. On the sum of the largest eigenvalues of a symmetric matrix. SIAM J. Matrix Anal. and Appl. 13, 41–45.
51. Overton, M. L., and Womersley, R. S. 1993. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Prog. 62, 321–357.
52. Papadimitriou, C. H., and Yannakakis, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425–440.
53. Pataki, G. 1994. On the multiplicity of optimal eigenvalues. Management Science Research Report MSRR-604, GSIA. Carnegie-Mellon Univ., Pittsburgh, Pa.
54. Patakj, G. 1995. On cone-LP's and semi-definite programs: Facial structure, basic solutions, and the simplex method. GSIA Working paper WP 1995–03, Carnegie-Mellon Univ., Pittsburgh, Pa.
55. Pouak, S., and Rendl, F, 1994. Node and edge relaxations of the max-cut problem. Computing 52, 123–137.
56. Pouak, S., and Rendl, F. 1995a. Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim., to appear.
57. Pouak, S., and Rendl, F. 1995b. Solving the max-cut problem using eigenvalues. Disc. Appl. Math. 62, 249–278.
58. Pouak, S., and Turzik, D. 1982. A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Can. /. Math. 34, 519–524.
59. Pouak, S., and Tuza, Z. 1995. Maximum cuts and largest bipartite subgraphs. In Combinatorial Optimization. W. Cook, L. Lovasz, and P. Seymour, eds. DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 20. American Mathematical Society, Providence, R.I. To be published.
60. Reinelt, G. 1991. TSPLIB—A traveling salesman problem library. ORSA J. Comput 3, 376–384.
61. Rendl, F., Vanderbei, R., and Wolkowicz, H. 1993. Interior point methods Ior max-min eigenvalue problems. Report 264, Technische Universitat Graz, Graz, Austria.
62. Rosenfeld, B. 1988. A history of non-Euclidean geometry. Springer-Verlag, Berlin. sahni, S., and gonzalez, T. 1976. P-complete approximation problems. J. ACM 23, 3 (July), 555–565.
63. Vaidya, P. M. 1989. A new algorithm for minimizing convex functions over convex sets. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 338–343.
64. Vandenberghe, L., and Boyd, S. 1996. Semidefinite programming. SIAM Rev. To appear.
65. Vitanyi, P. M. 1981. How well can a graph be n-colored? Disc. Math. 34, 69–80.
66. Wolkowicz, H. 1981, Some applications of optimization in matrix theory. Lin. Algebra Appl. 40, 101–118.
67. Yannakakis, M. 1994. On the approximation of maximum satisfiability. J. Algorithms 17, 475–502.