Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2005)

Cached

Download Links

by Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell

Citations:

BibTeX

@MISC{Khot05optimalinapproximability,
    author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell},
    title = {Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? },
    year = {2005}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of ffGW + ffl, for all ffl> 0; here ffGW ss.878567 denotes the approximation ratio achieved by the Goemans-Williamson algorithm [25]. This implies that if the Unique Games

Citations

1425	An Introduction to Probability Theory and Its Applications - Feller - 1957
1366	Handbook of mathematical functions - Abramowitz, Stegun - 1968
1117	Reducability Among Combinatorial Problems - Karp - 1972
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
561	Some optimal inapproximability results - Hastad - 2001
505	Optimization, approximation, and complexity classes - Papadimitriou, Yannakakis - 1988
220	P-complete approximation problems - Sahni, Gonzalez - 1976
191	Free bits, PCPs, and non-approximability — towards tight results - Bellare, Goldreich, et al. - 1998
190	The influence of variables on Boolean functions - Kahn, Kalai, et al. - 1988
181	On the power of unique 2-Prover 1-Round games - Khot - 2002
143	Improved Approximation Algorithms for MAX k-CUT - Frieze, Jerrum - 1997
125	Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT - Feige, Goemans - 1995
121	Every monotone graph property has a sharp threshold - Friedgut, Kalai - 1996
101	VISHNOI: The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1 - KHOT, NISHEETH - 2005
92	Vertex cover might be hard to approximate to within 2 − ǫ - Khot, Regev
91	Normal approximation and asymptotic expansions - Bhattacharya, Rao, et al. - 1986
87	Collective coin flipping - Ben-Or, Linial - 1990
71	On the importance of being biased - Dinur, Safra - 2002
68	A PCP characterization of NP with optimal amortized query complexity - Samorodnitsky, Trevisan - 2000
62	Noise sensitivity of Boolean functions and applications to percolation - Benjamini, Kalai, et al. - 1999
55	Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems - Zwick - 1999
54	Noise stability of functions with low influence: Invariance and optimality - Mossel, O’Donnell, et al. - 2005
52	Boolean functions with low average sensitivity depend on few coordinates - Friedgut - 1998
43	The influence of variables in product spaces - Bourgain, Kahn, et al. - 1992
37	On the optimality of the random hyperplane rounding technique for max cut - Feige, Schechtman
34	On the distributions of the Fourier spectrum of Boolean functions - Bourgain
31	How good is the Goemans-Williamson MAX CUT algorithm - Karloff - 1999
27	Influences of variables and threshold intervals under group symmetries, Geom - Bourgain, Kalai - 1997
27	Conditional hardness for approximate coloring - Dinur, Mossel, et al. - 2006
26	Hardness of approximate hypergraph coloring - Guruswami, Hastad, et al. - 2000
26	Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems - Lewin, Livnat, et al. - 2002
26	Approximation algorithms for unique games - Trevisan
24	linear programming - Gadgets
23	Boolean functions whose Fourier transform is concentrated on the first two levels - Friedgut, Kalai, et al.
19	Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming - Goemans, Williamson
18	Improved approximation of MaxCut on graphs of bounded degree - Feige, Karpinski, et al.
17	Approximating unique games - Gupta, Talvar - 2006
14	On Russo’s approximate 0-1 law - Talagrand - 1994
13	Trevisan: On Weighted vs Unweighted Versions of Combinatorial Optimization Problems - Crescenzi, Silvestri, et al.
13	Every linear threshold function has a low-weight approximator - Servedio - 2006
12	How much are increasing sets positively correlated - Talagrand - 1996
12	An appendix to Sharp thresholds of graph properties, and the k-sat problem, by - Bourgain - 1999
12	On the Fourier tails of bounded functions over the discrete cube - Dinur, Friedgut, et al.
12	On Systems of Linear Equations with Two Variables per Equation - Feige, Reichman - 2004
11	On the application of the theory of error to cases of normal distribution and normal correlations - Sheppard - 1899
11	On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the ϑ-Function - Klerk, Pasechnik, et al.
9	A Fourier-theoretic perspective on the Concordet paradox and Arrow’s theorem - Kalai
8	Improved approximation algorithms for - Frieze, Jerrum - 1995
7	On the noise sensitivity of monotone functions - Mossel, O’Donnell - 2002
6	Randomized rounding of semidefinite programs — variations on the MAX-CUT example - Feige - 1999