2 search results - page 1 / 1 » Space-Efficient Approximation Algorithms for MAXCUT and COLO... |
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...