.879-approximation algorithms for MAX CUT and MAX 2SAT

@inproceedings{Goemans1994879approximationAF,
  title={.879-approximation algorithms for MAX CUT and MAX 2SAT},
  author={Michel X. Goemans and David P. Williamson},
  booktitle={STOC '94},
  year={1994}
}
We present 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. 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. We then show how to derandomize the algorithm to obtain approximation algorithms with the… 
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
TLDR
This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming
TLDR
This algorithm gives the rst substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semideenite programming in the design of approximation algorithms.
New 3⁄4 - Approximation Algorithms for MAX SAT
TLDR
New, simple 3 4-approximational algorithm is presented that applies the probabilistic method/randomized rounding to the solution to a linear programming relaxation of MAX SAT and shows that although standard randomized rounding does not give a good approximate result, the best solution of the two given by randomized rounding and a well-known algorithm of Johnson is always within 3 4 of the optimal solution.
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.
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
TLDR
An algorithm is developed and analyzed which uses a novel sampling method to obtain improved bounds for approximating the Max-Cut of a graph and it is shown that by judicious choice of sampling probabilities one can obtain error bounds that are superior to the ones obtained by uniform sampling.
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.
Some new randomized approximation algorithms
TLDR
This thesis designs a polynomial time approximation scheme for the family Max Ek-Function Sat mod p of constraint satisfaction problems for which the domain is Zp, and proves lower bounds on the approximability of Max k-Horn Sat and Max E2-Lin mod p.
Sampling subproblems of heterogeneous Max‐Cut problems and approximation algorithms
TLDR
An algorithm is developed and analyzed which uses a novel sampling method to obtain improved bounds for approximating the Max‐Cut of a graph and it is shown that by judicious choice of sampling probabilities one can obtain error bounds that are superior to the ones obtained by uniform sampling.
Solving the Max-cut Problem Using Eigenvalues
z-Approximations
Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost
...
...

References

SHOWING 1-10 OF 40 REFERENCES
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.
Approximation and Intractability Results for the Maximum Cut Problem and its Variants
TLDR
It is shown that it is NP-complete to decide if a given graph has a normal maximum cut with at least a fraction 1/2+1/2n of its edges, where the positive constant epsilon can be taken smaller than any value chosen.
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.
A new algorithm for minimizing convex functions over convex sets
  • P. M. Vaidya
  • Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
This work presents a new algorithm for the feasibility problem that has a significantly better global convergence rate and time complexity than the ellipsoid algorithm and easily adapts to the convex optimization problem.
The ellipsoid method and its consequences in combinatorial optimization
TLDR
The method yields polynomial algorithms for vertex packing in perfect graphs, for the matching and matroid intersection problems, for optimum covering of directed cuts of a digraph, and for the minimum value of a submodular set function.
Some Simplified NP-Complete Graph Problems
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/.
Optimization, approximation, and complexity classes
TLDR
A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.
...
...