Sciweavers

711 search results - page 143 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
FOCS
2004
IEEE
13 years 8 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...