350 search results - page 1 / 70 » Approximation Algorithms for Unique Games |
81
Voted
FOCS
2005
IEEE
15 years 4 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
FOCS
2010
IEEE
14 years 8 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
STOC
2006
ACM
15 years 11 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 ...
APPROX
2008
Springer
15 years 18 days ago
2008
Springer
CORR
2010
Springer
14 years 11 months ago
2010
Springer