Subexponential Algorithms for Unique Games and Related Problems

We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:

• Type: Journal
• Year: 2010
• Where: FOCS
• Authors: Sanjeev Arora, Boaz Barak, David Steurer
• Keywords: FOCS 2010, Small-Set Expansion, Theoretical Computer Science, Time Approximation Algorithms, Unique Games