Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example

@inproceedings{Feige1999RandomizedRF,
  title={Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example},
  author={Uriel Feige},
  booktitle={RANDOM-APPROX},
  year={1999}
}
  • U. Feige
  • Published in RANDOM-APPROX 8 August 1999
  • Computer Science
MAX CUT is the problem of partitioning the vertices of a graph into two sets, maximizing the number of edges joining these sets. Goemans and Williamson gave an algorithm that approximates MAX CUT within a ratio of 0.87856. Their algorithm first uses a semidefinite programming relaxation of MAX CUT that embeds the vertices of the graph on the surface of an n dimensional sphere, and then cuts the sphere in two at random. 

On the optimality of the random hyperplane rounding technique for MAX CUT

TLDR
There are graphs and optimal embeddings for which the best hyperplane approximates opt within a ratio no better than α, even in the presence of additional valid constraints, which strengthens a result of Karloff that applied only to the expected number of edges cut by a random hyperplane.

More on Max Cut

  • Computer Science
TLDR
The max-cut algorithm of Goemans and Williamson is studied more closely and triangle constraints described below seem promising, which may strengthen the SDP by additional constraint that are valid for true 1 solutions.

23.1 Improving Convex Programming Relaxations

In past lectures we’ve learned that we write integer linear program (ILP) formulations to model hard problems exactly. But since these programs are too hard to solve, we relax them into linear

A new point of NP-hardness for unique games

TLDR
For these c, this is the first hardness result showing that it helps to take the alphabet size larger than 2 and the NP-hardness reductions are quasilinear-size and thus show nearly full exponential time is required, assuming the ETH.

CS 6550 – Design and Analysis of Algorithms Professor :

We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances between cities are Euclidean. This result, independently due to Arora

Social choice, computational complexity, Gaussian geometry, and Boolean functions

TLDR
A web of connections between the mathematical theory of voting and social choice; the computational complexity of the Maximum Cut problem; the Gaussian Isoperimetric Inequality and Borell's generalization thereof; the Hypercontractive Inequality of Bonami; and, the analysis of Boolean functions are described.

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

TLDR
Though it is unable to prove the majority is stablest conjecture, some partial results are enough to imply that MAX-CUT is hard to (3/4 + 1/(2/spl pi/) + /spl epsi/)-approximate (/spl ap/ .909155), assuming only the unique games conjecture.

References

SHOWING 1-10 OF 16 REFERENCES

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

A .699-approximation algorithm for Max-Bisection

  • Y. Ye
  • Computer Science
    Math. Program.
  • 2001
TLDR
A .699-approximation algorithm for Max-Bisection, i.e., partitioning the nodes of a weighted graph into two blocks of equal cardinality so as to maximize the weights of crossing edges.

Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

TLDR
Using outward rotations, an approximation algorithm is obtained for MAX CUT that performs better than the algorithm of Goemans and Williamson and an improved approximation algorithm for MAX NAE{3}-SAT is obtained.

Eigenvalues and graph bisection: An average-case analysis

  • R. Boppana
  • Computer Science, Mathematics
    28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
TLDR
This paper presents an algorithm that will, for almost all graphs in a certain class, output the minimum-size bisection and will yield a proof that the bisection is optimal.

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.

How good is the Goemans-Williamson MAX CUT algorithm?

TLDR
It is proved that the performance ratio of the semidefinite programming algorithm for MAX CUT is exactly α and it is shown that it is impossible to add valid linear constraints to improve the performance ratios.

Some optimal inapproximability results

We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations

A 7/8-approximation algorithm for MAX 3SAT?

  • H. KarloffU. Zwick
  • Computer Science
    Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
TLDR
A randomized approximation algorithm which takes an instance of MAX 3SAT as input that is optimal if the instance-a collection of clauses each of length at most three-is satisfiable, and a method of obtaining direct semidefinite relaxations of any constraint satisfaction problem of the form MAX CSP(F), where F is a finite family of Boolean functions.

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
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).

Approximating the independence number via theϑ-function

TLDR
An approximation algorithm for the independence number of a graph that improves the best known previous algorithm of Boppana and Halldorsson that finds an independent set of size Ω(m1/(k−1)) in such a graph.