Results 1  10
of
98
The Unique Games Conjecture, integrality gap for cut problems and embeddability of negative type metrics into `1
 In Proc. 46th IEEE Symp. on Foundations of Comp. Sci
, 2005
"... In this paper we disprove the following conjecture due to Goemans [17] and Linial [25] (also see [5, 27]): “Every negative type metric embeds into `1 with constant distortion. ” We show that for every δ> 0, and for large enough n, there is an npoint negative type metric which requires distortion ..."
Abstract

Cited by 170 (11 self)
 Add to MetaCart
(Show Context)
In this paper we disprove the following conjecture due to Goemans [17] and Linial [25] (also see [5, 27]): “Every negative type metric embeds into `1 with constant distortion. ” We show that for every δ> 0, and for large enough n, there is an npoint negative type metric which requires distortion atleast (log log n)1/6−δ to embed into `1. Surprisingly, our construction is inspired by the Unique Games Conjecture (UGC) of Khot [20], establishing a previously unsuspected connection between PCPs and the theory of metric embeddings. We first prove that the UGC implies superconstant hardness results for (nonuniform) Sparsest Cut and Minimum Uncut problems. It is already known that the UGC also implies an optimal hardness result for Maximum Cut [21]. Though these hardness results rely on the UGC, we demonstrate, nevertheless, that the corresponding PCP reductions can be used to construct “integrality gap instances ” for the respective problems. Towards this, we first construct an integrality gap instance for a natural SDP relaxation of Unique Games. Then, we “simulate ” the PCP reduction, and “translate ” the integrality gap instance of Unique Games to integrality gap instances for the respective cut problems! This enables us to prove
Inoculation Strategies for Victims of Viruses and the SumofSquares Partition Problem (Extended Abstract)
, 2004
"... ..."
Nearoptimal algorithms for Unique Games
 In Proceedings of the 38th Annual ACM Symposium on Theory of Computing
, 2006
"... Unique games are constraint satisfaction problems that can be viewed as a generalization of MaxCut to a larger domain size. The Unique Games Conjecture states that it is hard to distinguish between instances of unique games where almost all constraints are satisfiable and those where almost none ar ..."
Abstract

Cited by 46 (8 self)
 Add to MetaCart
Unique games are constraint satisfaction problems that can be viewed as a generalization of MaxCut to a larger domain size. The Unique Games Conjecture states that it is hard to distinguish between instances of unique games where almost all constraints are satisfiable and those where almost none are satisfiable. It has been shown to imply a number of inapproximability results for fundamental problems that seem difficult to obtain by more standard complexity assumptions. Thus, proving or refuting this conjecture is an important goal. We present significantly improved approximation algorithms for unique games. For instances with domain size k where the optimal solution satisfies 1 − ε fraction of all constraints, our algorithms satisfy roughly k −ε/(2−ε) and 1 − O ( √ ε log k) fraction of all constraints. Our algorithms are based on rounding a natural semidefinite programming relaxation for the problem and their performance almost matches the integrality gap of this relaxation. Our results are near optimal if the Unique Games Conjecture is true, i.e. any improvement (beyond low order terms) would refute the conjecture. 1
Approximation algorithms for unique games
 In FOCS ’05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
"... Abstract: A unique game is a type of constraint satisfaction problem with two variables per constraint. The value of a unique game is the fraction of the constraints satisfied by an optimal solution. Khot (STOC’02) conjectured that for arbitrarily small γ,ε> 0 it is NPhard to distinguish games of ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
Abstract: A unique game is a type of constraint satisfaction problem with two variables per constraint. The value of a unique game is the fraction of the constraints satisfied by an optimal solution. Khot (STOC’02) conjectured that for arbitrarily small γ,ε> 0 it is NPhard to distinguish games of value smaller than γ from games of value larger than 1 − ε. Several recent inapproximability results rely on Khot’s conjecture. Considering the case of subconstant ε, Khot (STOC’02) analyzes an algorithm based on semidefinite programming that satisfies a constant fraction of the constraints in unique games of value 1 − O(k−10 · (logk) −5), where k is the size of the domain of the variables. We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1−O(1/logn), satisfies a constant fraction of the constraints, where n is the number of variables. This is an improvement over Khot’s algorithm if the domain is sufficiently large.
Parallel repetition in projection games and a concentration bound
 In Proc. 40th STOC
, 2008
"... In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not based on some predicate of the questions and their answers. The parallel repetition of the game is the game in which the refe ..."
Abstract

Cited by 42 (8 self)
 Add to MetaCart
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not based on some predicate of the questions and their answers. The parallel repetition of the game is the game in which the referee samples n independent pairs of questions and sends corresponding questions to the players simultaneously. If the players cannot win the original game with probability better than (1 − ǫ), what’s the best they can do in the repeated game? We improve earlier results [Raz98, Hol07], which showed that the players cannot win all copies in the repeated game with probability better than (1 −ǫ 3) Ω(n/c) (here c is the length of the answers in the game), in the following ways: • We prove the bound (1 −ǫ 2) Ω(n) as long as the game is a “projection game”, the type of game most commonly used in hardness of approximation results. Our bound is independent of the answer length and has a better dependence on ǫ. By the recent work of Raz [Raz08], this bound is tight. A consequence of this bound is that the Unique Games Conjecture of Khot [Kho02] is equivalent to: Unique Games Conjecture There is an unbounded increasing function f: R + → R + such that for every ǫ> 0, there exists an alphabet size M(ǫ) for which it is NPhard to distinguish a Unique Game with alphabet size M in which a 1 −ǫ 2 fraction of the constraints can be satisfied from one in which a 1 − ǫf(1/ǫ) fraction of the constraints can be satisfied. • We prove a concentration bound for parallel repetition (of general games) showing that for any constant 0 < δ < ǫ, the probability that the players win a (1 −ǫ+δ) fraction of the games in the parallel repetition is at most exp � −Ω(δ 4 n/c) �. An application of this is in testing Bell Inequalities. Our result implies that the parallel repetition of the CHSH game can be used to get an experiment that has a very large classical versus quantum gap.
Improved lower bounds for embeddings into L1
 SIAM J. COMPUT.
, 2009
"... We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bo ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bound on the integrality gap of a wellknown semidefinite programming relaxation for sparsest cut. This result builds upon and improves the recent lower bound of (log log n) 1/6−o(1) due to Khot and Vishnoi [The unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l1, in Proceedings of the 46th Annual IEEE Symposium
Integrality gaps for strong SDP relaxations of unique games
"... Abstract — With the work of Khot and Vishnoi [18] as a starting point, we obtain integrality gaps for certain strong SDP relaxations of Unique Games. Specifically, we exhibit a Unique Games gap instance for the basic semidefinite program strengthened by all valid linear inequalities on the inner pro ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
(Show Context)
Abstract — With the work of Khot and Vishnoi [18] as a starting point, we obtain integrality gaps for certain strong SDP relaxations of Unique Games. Specifically, we exhibit a Unique Games gap instance for the basic semidefinite program strengthened by all valid linear inequalities on the inner products of up to exp(Ω(log log n) 1/4) vectors. For a stronger relaxation obtained from the basic semidefinite program by R rounds of Sherali–Adams liftandproject, we prove a Unique Games integrality gap for R = Ω(log log n) 1/4. By composing these SDP gaps with UGChardness reductions, the above results imply corresponding integrality gaps for every problem for which a UGCbased hardness is known. Consequently, this work implies that including any valid constraints on up to exp(Ω(log log n) 1/4) vectors to natural semidefinite program, does not improve the approximation ratio for any problem in the following classes: constraint satisfaction problems, ordering constraint satisfaction problems and metric labeling problems over constantsize metrics. We obtain similar SDP integrality gaps for Balanced Separator, building on [11]. We also exhibit, for explicit constants γ, δ> 0, an npoint negativetype metric which requires distortion Ω(log log n) γ to embed into ℓ1, although all its subsets of size exp(Ω(log log n) δ) embed isometrically into ℓ1. Keywordssemidefinite programming, approximation algorithms, unique games conjecture, hardness of approximation, SDP hierarchies, Sherali–Adams hierarchy, integrality gap construction 1.
Unique Games on Expanding Constraint Graphs are Easy (Extended ABstract)
 STOC'08
, 2008
"... We present an efficient algorithm to find a good solution to the Unique Games problem when the constraint graph is an expander. We introduce a new analysis of the standard SDP in this case that involves correlations among distant vertices. It also leads to a parallel repetition theorem for unique ga ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
We present an efficient algorithm to find a good solution to the Unique Games problem when the constraint graph is an expander. We introduce a new analysis of the standard SDP in this case that involves correlations among distant vertices. It also leads to a parallel repetition theorem for unique games when the graph is an expander.