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={Michel X. 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… 

Figures and Tables from this paper

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
TLDR
This paper analyzed a known relaxation for the Spars- est Cut problem based on positive semidefinite constraints, and presented a branch and bound algorithm and heuristics based on this relaxation, and showed that the proposed strategy leads to a better performance compared to the use of a known semidfinite programming solver.
Sums of squares based approximation algorithms for MAX-SAT
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
TLDR
A semidefinite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well with clauses of various sizes are presented and it is shown that no rounding procedure from the family considered can yield an approximation algorithm for MAX 4 -SAT whose performance guarantee on all instances of the problem is greater than 0.8724.
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
TLDR
An approximate solution for COLORING's semidefinite relaxation can be found in space O(m)+ O(n1.5), which reduces not only the space required by the best known approximation algorithm for graph COLORing, but also the only known polynomial-time algorithm for finding a maximum clique in a perfect graph.
Parallel Approximation Algorithms by Positive Linear Programming
TLDR
Improved parallel approximation algorithms for Max Sat, Max Directed Cut, and Maxk CSP are developed and a connection between probabilistic proof checking and a restricted version of MaxkCSP is shown, implying that the approximation algorithm for MaxK CSP can be used to prove inclusion in P for certain PCP classes.
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
TLDR
This approach uses Lagrangian duality to obtain a “nearly optimal” solution of the basic semidefinite Max-Cut relaxation, strengthened by triangle inequalities, and could prove optimality for several problems of the literature where, to the best of the knowledge, no other method is able to do so.
Approximating np-hard problems efficient algorithms and their limits
TLDR
A general black-box reduction from hard instances to a linear/semidefinite program to corresponding hardness results based on the Unique Games Conjecture confirms a widely suspected connection and settles the approximability of classic optimization problems such as CSPs, MULTIWAY CUT and MAXIMUM ACYCLIC SUBGRAPH.
Combinatorial approximation algorithms for the maximum directed cut problem
TLDR
It is gets that the maximum directed cut problem for bipartite digraphs can be solved in polynomial time and the maximum fractional independent set problem can be easily reduced to a bipartites matching problem.
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
TLDR
Improved approximation algorithms for the MAX 2-SAT and MAX DI-CUT problems are obtained, which are essentially the best performance ratios that can be achieved using any combination of prerounding rotations and skewed distributions of hyperplanes, and even using more general families of rounding procedures.
...
...

References

SHOWING 1-10 OF 97 REFERENCES
.879-approximation algorithms for MAX CUT and MAX 2SAT
TLDR
This research presents randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value and represents the first use of semidefinite programming in the design of approximation algorithms.
Derandomizing semidefinite programming based approximation algorithms
TLDR
This paper gives techniques to derandomize the above class of randomized algorithms, thus obtaining polynomial time deterministic algorithms with the same approximation ratios for the above problems.
Solving the Max-cut Problem Using Eigenvalues
Combinatorial Properties and the Complexity of a Max-cut Approximation
TLDR
It is shown that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition, and it can be adjusted for branch and bound techniques.
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
  • U. Feige, M. Goemans
  • Computer Science, Mathematics
    Proceedings Third Israel Symposium on the Theory of Computing and Systems
  • 1995
TLDR
The approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semideFinite programs, as introduced by Goemans and Williamson (SToc94).
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
TLDR
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Approximate graph coloring by semidefinite programming
TLDR
A randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with min {O(/spl Delta//sup 1/3/log/sup 4/3//spl Delta/), O(n/Sup 1/4/ log n)} colors is given, marking the first non-trivial approximation result as a function of the maximum degree /spl Delta/.
Approximate graph coloring by semidefinite programming
TLDR
A randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with min {O(/spl Delta//sup 1/3/log/sup 4/3//spl Delta/), O(n/Sup 1/4/ log n)} colors is given, marking the first non-trivial approximation result as a function of the maximum degree /spl Delta/.
Some Simplified NP-Complete Graph Problems
Free bits, PCPs and non-approximability-towards tight results
TLDR
A proof system for NP is presented using logarithmic randomness and two amortized free bits, so that Max clique is hard within N/sup 1/3/ and chromatic number within N-Sup 1/5/, and a comprehensive study of PCP and FPCP parameters is initiated.
...
...