107 search results - page 2 / 22 » Near-optimal algorithms for unique games |
105
click to vote
FOCS
2005
IEEE
15 years 6 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...
187
click to vote
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
114
click to vote
FOCS
2010
IEEE
14 years 11 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:
CORR
2010
Springer
15 years 1 months ago
2010
Springer
