# Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

@article{Goemans1995ImprovedAA, title={Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming}, author={M. Goemans and David P. Williamson}, journal={J. ACM}, year={1995}, volume={42}, pages={1115-1145} }

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… Expand

#### 3,336 Citations

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

- Mathematics, Computer Science
- RAIRO Oper. Res.
- 2011

Sums of squares based approximation algorithms for MAX-SAT

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2008

Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs

- Mathematics, Computer Science
- J. Algorithms
- 2001

Solving the max-cut problem using semidefinite optimization

- Computer Science
- 2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)
- 2016

Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs

- Mathematics, Computer Science
- IPCO
- 1999

Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs

- Mathematics, Computer Science
- ISAAC
- 1998

Parallel Approximation Algorithms by Positive Linear Programming

- Computer Science, Mathematics
- Algorithmica
- 1998

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

- Mathematics, Computer Science
- Math. Program.
- 2010

Improved approximation of Max-Cut on graphs of bounded degree

- Mathematics, Computer Science
- J. Algorithms
- 2002

#### References

SHOWING 1-2 OF 2 REFERENCES

Geomety 11

- Springer-Verlag, Berlin.
- 1987

Interior point methods for max-min

- 1993