Login / Signup
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
Guy Kindler
Ryan O'Donnell
Subhash Khot
Elchanan Mossel
Published in:
Electron. Colloquium Comput. Complex. (2005)
Keyphrases
</>
max cut
constraint satisfaction problems
constraint satisfaction
optimal solution
worst case
special case
dynamic programming
closed form
approximation algorithms
genetic algorithm
lower bound
np complete