MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming (1995) [606 citations — 17 self]

Abstract:

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of ...

Citations

868 Reducibility among combinatorial problems – Karp - 1972
864 Graph theory with applications – Bondy, Murty - 1976
789 Geometric Algorithms and Combinatorial Optimization, Springer-Verlag – Grotschel, Lov'asz, et al. - 1987
509 Proof verification and hardness of approximation problems – Arora, Lund, et al. - 1992
464 Optimization, approximation, and complexity classes – Papadimitriou, Yannakakis - 1991
442 Semidefinite programming – Vandenberghe, Boyd - 1996
387 Interior point methods in semidefinite programming with applications to combinatorial optimization – Alizadeh - 1995
283 Some simplified NP-complete graph problems – Garey, Johnson, et al. - 1976
224 On the Shannon capacity of a graph – Lov'asz - 1979
223 The ellipsoid method and its consequences in combinatorial optimization – Grotschel, Lov'asz, et al. - 1981
210 The Theory of Matrices – Lancaster, Tismenetsky - 1985
199 Interior point polynomial methods in convex programming: Theory and applications – Nesterov, Nemirovsky - 1994
192 TSPLIB { A traveling salesman problem library – Reinelt - 1991
189 T.Gonzalez. P-complete approximation problems – Sahni - 1976
177 Free bits, PCP and non-approximability - towards tight results – Bellare, Goldreich, et al. - 1998
165 Cones of matrices and set-functions and 0-1 optimization – Lovász, Schrijver - 1991
133 Improved approximation algorithms for max k-cut and max bisection – Frieze, Jerrum - 1995
128 Approximate graph coloring by semi-definite programming – Karger, Motwani, et al.
127 Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT – Feige, Goemans - 1995
104 Seminumerical Algorithms, volume 2 of The Art of Computer Programming – Knuth - 1981
103 A new algorithm for minimizing convex functions over convex sets – Vaidya - 1996
92 On the approximation of maximum satisfiability – Yannakakis - 1994
88 Approximation Algorithms for Set Covering and Vertex Cover Problems – Hochbaum - 1982
80 Two-prover one-round proof systems: Their power and their problems – Feige, Lovász - 1992
60 879approximation algorithms for max cut and max 2sat – Goemans, Williamson - 1994
60 New 3/4approximation algorithms for the maximum satisfiability problem – Goemans, Williamson - 1994
58 Finding a maximum cut of a planar graph in polynomial time – Hadlock - 1975
47 An application of combinatorial optimization to statistical physics and circuit layout design – Barahona, Grotschel, et al. - 1988
44 Laplacian eigenvalues and the maximum cut problem – Delorme, Poljak - 1993
42 A Linear Time Approximation Algorithm for the Weighted Vertex Cover Problem – Bar-Yehuda, Even - 1981
41 Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices – Overton, Womersley - 1993
36 Nonpolyhedral relaxations of graph-bisection problems – Poljak, Rendl - 1992
36 Derandomizing semidefinite programming based approximation algorithms – Mahajan, Ramesh
35 Eigenvalues in combinatorial optimization – MOHAR, POLJAK - 1993
32 Self-concordant functions and polynomial time methods in convex programming – Nesterov, Nemirovskii - 1990
26 Problems of distance geometry and convex properties of quadratic maps – Barvinok - 1995
22 Some applications of optimization in matrix theory – WOLKOWICZ - 1981
21 On the sum of the largest eigenvalues of a symmetric matrix – Overton, Womersley - 1992
20 A geometric approach to betweenness – Chor, Sudan - 1995
20 Combinatorial properties and the complexity of a max-cut approximation – Delorme, Poljak - 1993
19 Geometry II – Berger - 1987
19 Interior point methods for max-min eigenvalue problems – Rendl, Vanderbei, et al. - 1993
19 Seminumerical Algorithms, vol. 2 of The Art of Computer Programming – Knuth - 1997
18 Solving the max-cut problem using eigenvalues – Poljak, Rendl - 1995
18 New 3/4approximation algorithms for MAX SAT – Goemans, Williamson - 1994
10 The performance of an eigenvalue bound on the max-cut problem in some classes of graphs – Delorme, Poljak - 1993
10 Combinatorial optimization: Some problems and trends – Lov'asz - 1992
10 The max-cut problem --- a survey – Poljak, Tuza - 1995
10 How well can a graph be n-colored – Vit'anyi - 1981
9 Approximation and intractability results for the maximum cut problem and its variants – Haglin, Venkatesan - 1991
View or Download | Add to My Collection | Correct Errors