Sciweavers

12 search results - page 1 / 3
» Graph Expansion and the Unique Games Conjecture
Sort
View
STOC
2010
ACM
149views Algorithms» more  STOC 2010»
13 years 10 months ago
Graph Expansion and the Unique Games Conjecture
Prasad Raghavendra and David Steurer
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 5 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
13 years 3 months ago
How to Play Unique Games on Expanders
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...
Konstantin Makarychev, Yury Makarychev
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 16 days ago
How to Play Unique Games against a Semi-Random Adversary
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...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 9 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...