Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? 1: Assuming the Unique Games Conjecture, (1/2 − ρ/2)- versus ((arccos ρ)/π + ε)-Satisfiable MAX-CUT Is NP-Hard to DistinguishResearch Paper
MAX-CUT asks for a partition of the vertices of a graph that cuts as many edges, or as much edge weight, as possible. It is one of Karp's original NP-hard problems and the standard test case for approximation algorithms. A uniformly random partition cuts half of the edges in expectation. Goemans and Williamson (JACM 1995) rounded a semidefinite relaxation…