Subexponential Algorithms for Unique Games and Related Problems

13 years 2 months ago

Download www.cs.princeton.edu

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

Sanjeev Arora, Boaz Barak, David Steurer

Real-time Traffic

FOCS 2010 | Small-Set Expansion | Theoretical Computer Science | Time Approximation Algorithms | Unique Games |

claim paper

Related Content

» Spectral Algorithms for Unique Games

» A Deterministic Subexponential Algorithm for Solving Parity Games

» Linear Complementarity and PMatrices for Stochastic Games

» Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

» Nearoptimal algorithms for unique games

» How to Play Unique Games on Expanders

» How to Play Unique Games Using Embeddings

» Approximate Lasserre Integrality Gap for Unique Games

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Sanjeev Arora, Boaz Barak, David Steurer

Comments (0)

Sciweavers

Subexponential Algorithms for Unique Games and Related Problems

FOCS 2010 | Small-Set Expansion | Theoretical Computer Science | Time Approximation Algorithms | Unique Games |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers