1.6k citations
- IBM Research - Thomas J. Watson Research CenterUS7 papers
- California Institute of TechnologyUS3 papers
- Columbia UniversityUS3 papers
- Kyoto UniversityJP3 papers
- University of BristolGB3 papers
- IBM Research - AlmadenUS2 papers
- Los Alamos National LaboratoryUS2 papers
- Nara Institute of Science and TechnologyJP2 papers
- Osaka Prefecture UniversityJP2 papers
- Stanford UniversityUS2 papers
- University of AmsterdamNL2 papers
- University of MichiganUS2 papers
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009
How to Play Unique Games on Expanders
Konstantin Makarychev, Yury Makarychev
In this note we improve a recent result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a -satisfiabl…
cs.DS2006★ 11 cited
Approximate Convex Optimization by Online Game Playing
Elad Hazan
Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a app…