By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. Khot ; Sch. of Math., Inst. for Adv. Study, Princeton, NJ, USA ; G. Kindler ; E. Mossel ; R. O'Donnell

In this paper, we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of αcw+ ε, for all ε > 0, where αcw denotes the approximation ratio achieved by the Goemans-Williamson algorithm (1995). αcw ≈ .878567. This result is conditional, relying on two conjectures: a) the unique games conjecture of Khot; and, b) a very believable conjecture we call the majority is stablest conjecture. These results indicate that the geometric nature of the Goemans-Williamson algorithm might be intrinsic to the MAX-CUT problem. The same two conjectures also imply that it is NP-hard to (β + ε)-approximate MAX-2SAT, where β ≈ .943943 is the minimum of (2 + (2/π) θ)/(3 - cos(θ)) on (π/2, π). Motivated by our proof techniques, we show that if the MAX-2CSP and MAX-2SAT problems are slightly restricted - in a way that seems to retain all their hardness -then they have (αGW-ε)- and (β - ε)-approximation algorithms, respectively. Though we are unable to prove the majority is stablest conjecture, we give some partial results and indicate possible directions of attack. Our partial results are enough to imply that MAX-CUT is hard to (3/4 + 1/(2π) + ε)-approximate (≈ .909155), assuming only the unique games conjecture. We also discuss MAX-2CSP problems over non-Boolean domains and state some related results and conjectures. We show, for example, that the unique games conjecture implies that it is hard to approximate MAX-2LIN(q) to within any constant factor.

Published in:

Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on

Date of Conference:

17-19 Oct. 2004