Results 1  10
of
33
Optimal inapproximability results for MAXCUT and other 2variable CSPs?
, 2005
"... In this paper we show a reduction from the Unique Games problem to the problem of approximating MAXCUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the GoemansWilliamson algorithm [25]. This implies that if the Unique Games ..."
Abstract

Cited by 173 (24 self)
 Add to MetaCart
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAXCUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the GoemansWilliamson algorithm [25]. This implies that if the Unique Games
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 40 (9 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
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes
 In IEEE Symposium on Foundations of Computer Science (FOCS
, 2008
"... In this paper we derive tight bounds on the expected value of products of low influence functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated probability spaces, on a generalization of an invariance principle recentl ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
In this paper we derive tight bounds on the expected value of products of low influence functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated probability spaces, on a generalization of an invariance principle recently obtained with O’Donnell and Oleszkiewicz for multilinear polynomials with low influences and bounded degree and on properties of multidimensional Gaussian distributions. We present two applications of the new bounds to the theory of social choice. We show that Majority is asymptotically the most predictable function among all low influence functions given a random sample of the voters. Moreover, we derive an almost tight bound in the context of Condorcet aggregation and low influence voting schemes on a large number of candidates. In particular, we show that for every low influence aggregation function, the probability that Condorcet voting on k candidates will result in a unique candidate that is preferable to all others is k−1+o(1). This matches the asymptotic behavior of the majority function for which the probability is k−1−o(1). A number of applications in hardness of approximation in theoretical computer science were
A brief introduction to Fourier analysis on the Boolean cube
 Theory of Computing Library– Graduate Surveys
, 2008
"... Abstract: We give a brief introduction to the basic notions of Fourier analysis on the ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Abstract: We give a brief introduction to the basic notions of Fourier analysis on the
Towards Sharp Inapproximability For Any 2CSP
, 2008
"... We continue the recent line of work on the connection between semidefinite programmingbased approximation algorithms and the Unique Games Conjecture. Given any boolean 2CSP (or more generally, any nonnegative objective function on two boolean variables), we show how to reduce the search for a good ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We continue the recent line of work on the connection between semidefinite programmingbased approximation algorithms and the Unique Games Conjecture. Given any boolean 2CSP (or more generally, any nonnegative objective function on two boolean variables), we show how to reduce the search for a good inapproximability result to a certain numeric minimization problem. The key objects in our analysis are the vector triples arising when doing clausebyclause analysis of algorithms based on semidefinite programming. Given a weighted set of such triples of a certain restricted type, which are “hard” to round in a certain sense, we obtain a Unique Gamesbased inapproximability matching this “hardness ” of rounding the set of vector triples. Conversely, any instance together with an SDP solution can be viewed as a set of vector triples, and we show that we can always find an assignment to the instance which is at least as good as the “hardness ” of rounding the corresponding set of vector triples. We conjecture that the restricted type required for the hardness result is in fact no restriction, which would imply that these upper and lower bounds match exactly. This conjecture is supported by all existing results for specific 2CSPs. As an application, we show that MAX 2AND is hard to approximate within 0.87435. Thisimproves upon the best previous hardness of αGW + ɛ ≈ 0.87856, and comes very close to matching the approximation ratio of the best algorithm known, 0.87401. It also establishes that balanced instances of MAX 2AND, i.e., instances in which each variable occurs positively and negatively equally often, are not the hardest to approximate, as these can be approximated within a factor αGW.
On the unique games conjecture
 In FOCS
, 2005
"... This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1 ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
"... We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Gameshard to approximate log log d to within a factor 2−(2+od(1)). This exactly log d matches the algorithmic result of Halperin [1] up to the od(1) term. • Independent Set ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Gameshard to approximate log log d to within a factor 2−(2+od(1)). This exactly log d matches the algorithmic result of Halperin [1] up to the od(1) term. • Independent Set is Unique Gameshard to approxid mate to within a factor O( log2). This improves the d d logO(1) Unique Games hardness result of Samorod
The unique game conjecture with entangled provers is false
, 2007
"... We consider oneround games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique ’ constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program. Essentially the only a ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We consider oneround games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique ’ constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program. Essentially the only algorithm known previously was for the special case of binary answers, as follows from the work of Tsirelson in 1980. Among other things, our result implies that the variant of the unique games conjecture where we allow the provers to share entanglement is false. Our proof is based on a novel ‘quantum rounding technique’, showing how to take a solution to an SDP and transform it to a strategy for entangled provers. 1
Nonnegative Weighted #CSPs: An Effective Complexity Dichotomy
"... We prove a complexity dichotomy theorem for all nonnegative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms [19, 8, 18, 12] and the celebrated dichotomy theorem for unwe ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We prove a complexity dichotomy theorem for all nonnegative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms [19, 8, 18, 12] and the celebrated dichotomy theorem for unweighted #CSP [6, 4, 21, 22]. Our dichotomy theorem gives a succinct criterion for tractability. If a set F of constraint functions satisfies the criterion, then the counting CSP problem defined by F is solvable in polynomial time; if it does not satisfy the criterion, then the problem is #Phard. We furthermore show that the question of whether F satisfies the criterion is decidable in NP. Surprisingly, our tractability criterion is simpler than the previous criteria for the more restricted classes of problems, although when specialized to those cases, they are logically equivalent. Our proof mainly uses Linear