2 search results - page 1 / 1 » Space-Efficient Approximation Algorithms for MAXCUT and COLO... |
96
Voted
ISAAC
1998
Springer
15 years 7 months ago
1998
Springer
143
Voted
STOC
2006
ACM
16 years 3 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 ...