Semidefinite programming in combinatorial optimization

Mathematical Programming, Series B

Volumn 79, Issue 1-3, 1997, Pages 143-161

  Goemans, Michel X ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Coding theory; Combinatorial optimization; Maximum cut; Semidefinite programming; Stable set

Indexed keywords

EID: 0000457427     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614315     Document Type: Article

References (67)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization 5 (1995) 13-51.
2. F. Alizadeh, J.-P. Haeberly and M. Overton, Complementarity and nondegeneracy in semidefinite programming, Technical Report, Courant Institute of Mathematical Sciences, 1995; also in: Mathematical Programming, to appear.
3. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83-96.
4. N. Alon and N. Kanale, Approximating the independence number via the θ function, Manuscript, 1994.
5. 1, isoperimetric inequalities for graphs and superconcentrators, Journal of Combinatorial Theory B 38 (1985) 73-88.
6. Y. Aumann and Y. Rabani, An O(log k) approximate min-cut max-flow theorem and approximation algorithm, SIAM Journal on Computing, to appear.
7. E. Balas, S. Ceria and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 (1993) 295-324.
8. F. Barahona and A. Mahjoub, On the cut polytope, Mathematical Programming 36 (1986) 157-173.
9. A.I. Barvinok, Problems of distance geometry and convex properties of quadratic maps, Discrete and Computational Geometry 13 (1995) 189-202.
10. J. Bourgain, On Lipschitz embedding of finite metric spaces in Hubert space, Israel Journal of Mathematics 52 (1985) 46-52.
11. A. Brouwer and W. Haemers, Association schemes, in: R. Graham, M. Grötschel and L. Lovász, eds., Handbook of Combinatorics (North-Holland, Amsterdam, 1995) 747-771.
12. B. Chor and M. Sudan, A geometric approach to betweenness, in: Proceedings of the 3rd European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 979 (Springer, Berlin, 1995) 227-237.
13. C. Delorme and S. Poljak, Combinatorial properties and the complexity of a max-cut approximation, European Journal of Combinatorics 14 (1993) 313-333.
14. C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Mathematical Programming 62 (1993) 557-574.
15. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports, Supplement 10 (1973).
16. M. Deza and M. Laurent, Geometry of Cuts and Metrics, Algorithms and Combinatorics (Springer, Berlin, 1997).
17. U. Feige, Randomized graph products, chromatic numbers, and the Lovász θ-function, in: Proceedings of the 27th ACM Symposium on Theory of Computing (1995) 635-640.
18. U. Feige and M.X. Goemans, 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 Comput. and Syst. (1995) 182-189.
19. A. Frieze and M. Jerrum, Improved approximation algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18 (1997) 67-81.
20. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145; A preliminary version entitled ".878-Approximation algorithms for MAXCUT and MAX2SAT" has appeared in Proceedings 26th ACM Symposium on Theory of Computing (1994) 422-431.
21. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145; A preliminary version entitled ".878-Approximation algorithms for MAXCUT and MAX2SAT" has appeared in Proceedings 26th ACM Symposium on Theory of Computing (1994) 422-431.
22. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
23. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 169-197.
24. M. Grötschel, L. Lovász and A. Schrijver, Relaxations of vertex packing, Journal of Combinatorial Theory B 40 (1986) 330-343.
25. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
26. 1-ε, in: Proceedings of the 37th Symposium on Foundations of Computer Science (1996) 627-636.
27. J. Håstad, Some optimal inapproximability results, in: Proceedings of the 29th ACM Symposium on Theory of Computing (1997) pp. 1-10.
28. D.S. Hochbaum, Approximation algorithms for the set covering and vertex cover problems, SIAM Journal on Computing 11 (1982) 555-556.
29. R. Horn and C. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, 1985).
30. F. Juhász, The asymptotic behavior of Lovász' θ function for random graphs, Combinatorica (1982) 153-155.
31. D. Karger, R. Motwani and M. Sudan, Approximate graph coloring by semidefinite programming, in: Proceedings 35th of the Symposium on Foundations of Computer Science (1994) 2-13.
32. H. Karloff, How good is the Goemans-Williamson MAX CUT algorithm, in: Proceedings of the 28th ACM Symposium on Theory of Computing (1996) 427-434.
33. J. Kleinberg and M.X. Goemans, The Lovász theta function and a semidefinite programming relaxation of vertex cover, SIAM Journal on Discrete Mathematics, to appear.
34. D. Knuth, The sandwich theorem, Electronic Journal of Combinatorics 1 (1994); http://ejc.math.gatech.edu:8000/Journal/journalhome.html
35. M. Kojima, Interior-point methods for semidefinite programming, Mathematical Programming (1997) (this volume).
36. J. Lagergren and A. Russell, Vertex cover eludes the Schrijver function, Manuscript, 1997.
37. P. Lancaster and M. Tismenetsky, The Theory of Matrices (Academic Press, Orlando, FL, 1985).
38. M. Laurent, S. Poljak and F. Rendl, Connections between the semidefinite relaxations of the max-cut and stable set problems, Mathematical Programming 11 (1997) 225-246.
39. F. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proceedings of the 29th Symposium on Foundations of Computer Science (1988) 422-431.
40. A. Lewis and M. Overton, Eigenvalue optimization, Acta Numerica 5 (1996) 149-190.
41. N. Linial, E. London and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995) 215-246.
42. L. Lovász, On the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979) 1-7.
43. L. Lovász, Perfect graphs, in: L. Beineke and R. Wilson, eds., Selected Topics in Graph Theory, Vol. 2 (Academic Press, New York, 1983) 55-87.
44. L. Lovász, Combinatorial optimization: Some problems and trends, Technical Report 92-53, DIMACS, 1992.
45. L. Lovász and A. Schrijver, Matrix cones, projection representations, and stable set polyhedra, in: Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1 (AMS, Providence, RI, 1989) 1-17.
46. L. Lovász and A. Schrijver, Cones of matrices and setfunctions, and 0-1 optimization, SIAM Journal on Optimization 1 (1991) 166-190.
47. F. MacWilliams and N. Sloane, The Theory of Error Correcting Codes (North-Holland, Amsterdam, 1977).
48. S. Mahajan and H. Ramesh, Derandomizing semidefinite programming based approximation algorithms, in: Proceedings 36th Symposium on Foundations of Computer Science (1995) 162-169.
49. G. Malajovich, An effective version of Kronecker's theorem on simultaneous Diophantine approximation, Technical Report, City University of Hong Kong, 1996.
50. R. McEliece, The bounds of Delsarte and Lovász, and their applications to coding theory, in: G. Longo, ed., Algebraic Coding Theory and Applications (Springer, Berlin, 1979) 107-178.
51. R. McEliece, E. Rodemich, H. Rumsey and L. Welch, New upper bounds on the rate of a code via the Delsarte-McWilliams inequalities, IEEE Transactions on Information Theory 23 (1977) 157.
52. B. Mohar and S. Poljak, Eigenvalue methods in combinatorial optimization, in: R. Brualdi, S. Friedland and V. Klee, eds., Combinatorial and Graph-Theoretic Problems in Linear Algebra, The IMA Volumes in Mathematics and its Applications, Vol. 50 (Springer, Berlin, 1993) 107-151.
53. Y. Nesterov, Quality of semidefinite relaxation for nonconvex quadratic optimization, Manuscript, 1997.
54. Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming (SIAM, Philadelphia, PA, 1994).
55. G. Pataki, On cone-LP's and semi-definite programs: Facial structure, basic solutions, and the simplex method, GSIA Working Paper WP 1995-03, Carnegie-Mellon University, 1995.
56. S. Poljak, Polyhedral and eigenvalue approximations of the max-cut problem, in: G. Halász et al., eds., Sets, Graphs, and Numbers, Colloquia Mathematica Societatis János Bolyai, Vol. 60 (North-Holland, Amsterdam, 1992) 569-581.
57. S. Poljak and F. Rendl, Nonpolyhedral relaxations of graph-bisection problems, SIAM Journal on Optimization 5 (1995) 467-487.
58. S. Poljak and Z. Tuza, Maximum cuts and largest bipartite subgraphs, in: W. Cook, L. Lovász and P. Seymour, eds., Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (AMS, Providence, RI, 1995).
59. F. Rendl, Semidefinite programming and combinatorial optimization, Notes for a lecture series given at the University of Pisa, 1997.
60. A. Schrijver, A comparison of the Delsarte and Lovász bounds, IEEE Transactions on Information Theory 25 (1979) 425-429.
61. C. Shannon, The zero error capacity of a channel, IRE Transactions on Information Theory 2 (1956) 8-19.
62. H. Sherali and W. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM Journal on Discrete Mathematics 3 (1990) 411-430.
63. A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing markov chains, Information and Computation 82 (1989) 93-133.
64. M. Szegedy, A note on the theta number of Lovász and the generalized Delsarte bound, in: Proceedings of the 35th Symposium on Foundations of Computer Science (1994) 36-39.
65. P. Tiwari, A problem that is easier to solve on the unit-cost algebraic RAM, Journal of Complexity 8 (1992) 393-397.
66. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49-95.
67. M. Yannakakis, Expressing combinatorial optimization problems by linear programs, in: Proceedings of the 29th Symposium on Foundations of Computer Science (1988) 223-228.