350 search results - page 5 / 70 » Approximation Algorithms for Unique Games |
110
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
STOC
2010
ACM
15 years 6 months ago
2010
ACM
100
click to vote
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
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...
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
130
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...