## Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2005)

### Cached

### Download Links

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

Citations: | 179 - 27 self |

### BibTeX

@MISC{Khot05optimalinapproximability,

author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell},

title = {Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? },

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the Goemans-Williamson algorithm [25]. This implies that if the Unique Games