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

SIAM Journal on Computing

Volumn 37, Issue 1, 2007, Pages 319-357

  Khot, Subhash ^a,b   Kindler, Guy ^b,c   Mossel, Elchanan ^d   O'Donnell, Ryan ^e  

^a Georgia Institute of Technology   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e University of California at Berkeley ^*  (United States)

Author keywords

Constraint satisfaction; Hardness of approximation; MAX CUT; Unique games

Indexed keywords

CONSTRAINT SATISFACTION; HARDNESS OF APPROXIMATION; MAX-CUT; UNIQUE GAMES;

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

GAME THEORY;

EID: 40049085242     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447372     Document Type: Conference Paper

References (57)