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

  title={Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming},
  author={Michel X. Goemans and David P. Williamson},
  journal={J. ACM},
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

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

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.

Solving the max-cut problem using semidefinite optimization

  • Derkaoui OrkiaA. Lehireche
  • Computer Science
    2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)
  • 2016
A new variant of the solver CSDP (C library for semidfinite programming) is used, based on a Majorize-Minimize line search algorithm for barrier function optimization, which is built to approximate a scalar criterion containing a barrier function.

Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs

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

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.

Approximating np-hard problems efficient algorithms and their limits

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

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.

An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut

This work compares the results of the Goemans and Williamson algorithm using semidefinite programming with Trevisan’s algorithm using spectral partitioning and finds that the spectral algorithms provide a significant speed advantage over the SDP.



New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem

It is shown 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 $\frac{3}{4}$ of the optimal solution.

Derandomizing semidefinite programming based approximation algorithms

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

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.

Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise

Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

  • U. FeigeM. Goemans
  • Computer Science, Mathematics
    Proceedings Third Israel Symposium on the Theory of Computing and Systems
  • 1995
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

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

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

Geomety 11

  • Springer-Verlag, Berlin.
  • 1987