Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2011
Springer
215views Education» more  CORR 2011»
10 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
CORR
2011
Springer
159views Education» more  CORR 2011»
11 years 3 months 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...
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
11 years 5 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
FOCS
2010
IEEE
11 years 6 months ago
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:
Sanjeev Arora, Boaz Barak, David Steurer
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
11 years 9 months ago
Approximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
Subhash Khot, Preyas Popat, Rishi Saket
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
11 years 12 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
FOCS
2005
IEEE
12 years 1 months ago
Approximation Algorithms for Unique Games
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...
Luca Trevisan
COCO
2007
Springer
84views Algorithms» more  COCO 2007»
12 years 2 months ago
Understanding Parallel Repetition Requires Understanding Foams
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
Uriel Feige, Guy Kindler, Ryan O'Donnell
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
12 years 8 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
12 years 8 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
books