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

Subhash Khot, Guy Kindler, Ryan O'Donnell, Elchanan Mossel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of α GW+ε, for all ε > 0, where α GW denotes the approximation ratio achieved by the Goemans-Williamson algorithm [14], α GW ≈ .878567. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; 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 MAX2CSP 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.

Original languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages146-154
Number of pages9
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: Oct 17 2004Oct 19 2004

Other

OtherProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004
CountryItaly
CityRome
Period10/17/0410/19/04

Fingerprint

Approximation algorithms
Hardness

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Khot, S., Kindler, G., O'Donnell, R., & Mossel, E. (2004). Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 146-154)

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? / Khot, Subhash; Kindler, Guy; O'Donnell, Ryan; Mossel, Elchanan.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 146-154.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S, Kindler, G, O'Donnell, R & Mossel, E 2004, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. pp. 146-154, Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, 10/17/04.
Khot S, Kindler G, O'Donnell R, Mossel E. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 146-154
Khot, Subhash ; Kindler, Guy ; O'Donnell, Ryan ; Mossel, Elchanan. / Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. pp. 146-154
@inproceedings{3a134335e7264e43811908ab7fb22285,
title = "Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?",
abstract = "In this paper we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of α GW+ε, for all ε > 0, where α GW denotes the approximation ratio achieved by the Goemans-Williamson algorithm [14], α GW ≈ .878567. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; 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 MAX2CSP 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.",
author = "Subhash Khot and Guy Kindler and Ryan O'Donnell and Elchanan Mossel",
year = "2004",
language = "English (US)",
pages = "146--154",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

}

TY - GEN

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

AU - Khot, Subhash

AU - Kindler, Guy

AU - O'Donnell, Ryan

AU - Mossel, Elchanan

PY - 2004

Y1 - 2004

N2 - In this paper we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of α GW+ε, for all ε > 0, where α GW denotes the approximation ratio achieved by the Goemans-Williamson algorithm [14], α GW ≈ .878567. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; 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 MAX2CSP 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.

AB - In this paper we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of α GW+ε, for all ε > 0, where α GW denotes the approximation ratio achieved by the Goemans-Williamson algorithm [14], α GW ≈ .878567. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; 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 MAX2CSP 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.

UR - http://www.scopus.com/inward/record.url?scp=17744388630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17744388630&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:17744388630

SP - 146

EP - 154

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

ER -