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 $\alpha_{\text{\tiny{GW}}} + \epsilon$ for all $\epsilon > 0$; here $\alpha_{\text{\tiny{GW}}} \approx .878567$ denotes the approximation ratio achieved by the algorithm of Goemans and Williamson in [J. Assoc. Comput. Mach., 42 (1995), pp. 1115–1145]. This implies that if the Unique Games Conjecture of Khot in [Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 767–775] holds, then the Goemans–Williamson approximation algorithm is optimal. Our result indicates that the geometric nature of the Goemans–Williamson algorithm might be intrinsic to the MAX‐CUT problem. Our reduction relies on a theorem we call Majority Is Stablest. This was introduced as a conjecture in the original version of this paper, and was subsequently confirmed in [E. Mossel, R. O’Donnell, and K. Oleszkiewicz, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 21–30]. A stronger version of this conjecture called Plurality Is Stablest is still open, although [E. Mossel, R. O’Donnell, and K. Oleszkiewicz, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 21–30] contains a proof of an asymptotic version of it. Our techniques extend to several other two‐variable constraint satisfaction problems. In particular, subject to the Unique Games Conjecture, we show tight or nearly tight hardness results for MAX‐2SAT, MAX‐q‐CUT, and MAX‐2LIN(q). For MAX‐2SAT we show approximation hardness up to a factor of roughly $.943$. This nearly matches the $.940$ approximation algorithm of Lewin, Livnat, and Zwick in [Proceedings of the 9th Annual Conference on Integer Programming and Combinatorial Optimization, Springer‐Verlag, Berlin, 2002, pp. 67–82]. Furthermore, we show that our .943... factor is actually tight for a slightly restricted version of MAX‐2SAT. For MAX‐q‐CUT we show a hardness factor which asymptotically (for large q) matches the approximation factor achieved by Frieze and Jerrum [Improved approximation algorithms for MAX k‐CUT and MAX BISECTION, in Integer Programming and Combinatorial Optimization, Springer‐Verlag, Berlin, pp. 1–13], namely $1 - 1/q + 2({\rm ln}\,q)/q^2$. For MAX‐2LIN(q) we show hardness of distinguishing between instances which are $(1-\epsilon)$‐satisfiable and those which are not even, roughly, $(q^{-\epsilon/2})$‐satisfiable. These parameters almost match those achieved by the recent algorithm of Charikar, Makarychev, and Makarychev [Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 205–214]. The hardness result holds even for instances in which all equations are of the form $x_i - x_j = c$. At a more qualitative level, this result also implies that $1-\epsilon$ vs. ε hardness for MAX‐2LIN(q) is equivalent to the Unique Games Conjecture.

MSC codes

  1. 68Q17

Keywords

  1. MAX‐CUT
  2. Unique Games
  3. hardness of approximation
  4. constraint satisfaction

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, Dover, New York, 1972.
2.
G. Andersson, L. Engebretsen, and J. Håstad, A new way of using semidefinite programming with applications to linear equations mod p, J. Algorithms, 39 (2001), pp. 162–204.
3.
M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and non‐approximability—towards tight results, SIAM J. Comput., 27 (1998), pp. 804–915.
4.
M. Ben‐Or and N. Linial, Collective coin flipping, in Randomness and Computation, S. Micali, ed., Academic Press, New York, 1990.
5.
I. Benjamini, G. Kalai, and O. Schramm, Noise sensitivity of boolean functions and applications to percolation, Inst. Hautes Études Sci. Publ. Math., 90 (1999), pp. 5–43.
6.
R. Bhattacharya and R. Rao, Normal Approximation and Asymptotic Expansions, Robert E. Krieger, Melbourne, FL, 1986.
7.
J. Bourgain, An appendix to Sharp thresholds of graph properties, and the k‐SAT problem, by E. Friedgut, J. Amer. Math. Soc., 12 (1999), pp. 1017–1054.
8.
J. Bourgain, On the distribution of the Fourier spectrum of boolean functions, Israel J. Math., 131 (2002), pp. 269–276.
9.
J. Bourgain, J. Kahn, G. Kalai, Y. Katznelson, and N. Linial, The influence of variables in product spaces, Israel J. Math., 77 (1992), pp. 55–64.
10.
J. Bourgain and G. Kalai, Influences of variables and threshold intervals under group symmetries, Geom. Funct. Anal., 7 (1997), pp. 438–461.
11.
M. Charikar, K. Makarychev, and Y. Makarychev, Near‐optimal algorithms for unique games, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 205–214.
12.
P. Crescenzi, R. Silvestri, and L. Trevisan, On weighted vs unweighted versions of combinatorial optimization problems, Inform. Comput., 167 (2001), pp. 10–26.
13.
E. de Klerk, D. Pasechnik, and J. Warners, On approximate graph colouring and MAX‐k‐CUT algorithms based on the ϑ‐function, J. Comb. Optim., 8 (2004), pp. 267–294.
14.
I. Dinur, E. Friedgut, G. Kindler, and R. O’Donnell, On the Fourier tails of bounded functions over the discrete cube, Israel J. Math., to appear.
15.
I. Dinur, E. Mossel, and O. Regev, Conditional hardness for approximate coloring, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2005, pp. 344–353.
16.
I. Dinur and S. Safra, The importance of being biased, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 33–42.
17.
U. Feige, M. Karpinski, and M. Langberg, Improved approximation of MAX‐CUT on graphs of bounded degree, J. Algorithms, 43 (2002), pp. 201–219.
18.
U. Feige, Randomized rounding of semidefinite programs—variations on the MAX‐CUT example, Lecture Notes in Comput. Sci. 1761, Springer‐Verlag, Berlin, 1999, pp. 189–196.
19.
U. Feige and M. Goemans, Approximating the value of two prover proof systems, with applications to MAX‐2SAT and MAX‐DICUT, in Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, 1995, pp. 182–189.
20.
U. Feige and G. Schechtman, On the optimality of the random hyperplane rounding technique for MAX‐CUT, Random Structures Algorithms, 20 (2002), pp. 403–440.
21.
W. Feller, An Introduction to Probability Theory and Its Applications, John Wiley and Sons, New York, 1968.
22.
U. Fiege and D. Reichman, On systems of linear equations with two variables per equation, in APPROX‐RANDOM, 2004, pp. 117–127.
23.
E. Friedgut, Boolean functions with low average sensitivity depend on few coordinates, Combinatorica, 18 (1998), pp. 474–483.
24.
E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc., 124 (1996), pp. 2993–3002.
25.
E. Friedgut, G. Kalai, and A. Naor, Boolean functions whose Fourier transform is concentrated at the first two levels, Adv. in Appl. Math., 29 (2002), pp. 427–437.
26.
A. Frieze and M. Jerrum, Improved approximation algorithms for MAX k‐CUT and MAX BISECTION, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 920, E. Balas and J. Clausen, eds., Springer‐Verlag, Berlin, 1995, pp. 1–13.
27.
M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115–1145.
28.
M. Goemans and D. Williamson, Approximation algorithms for MAX‐3‐CUT and other problems via complex semidefinite programming, J. Comput. System Sci., 68 (2004), pp. 442–470.
29.
G. Guilbaud, Theories of general interest, and the logical problem of aggregation, in Readings in Mathematical Social Science, MIT Press, Cambridge, MA, 1966, pp. 262–307.
30.
A. Gupta and K. Talwar, Approximating Unique Games, in Proceedings of the Seventeenth Annual ACM‐SIAM Symposium on Discrete Algorithms, 2006.
31.
V. Guruswami, J. Håstad, and M. Sudan, Hardness of approximate hypergraph coloring, SIAM J. Comput., 31 (2002), pp. 1663–1686.
32.
J. Håstad, On a Protocol Possibly Useful for MIN‐2SAT, manuscript, 2001.
33.
J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798–869.
34.
J. Kahn, G. Kalai, and N. Linial, The influence of variables on boolean functions, in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 68–80.
35.
G. Kalai, A Fourier‐theoretic perspective on the Concordet paradox and Arrow’s theorem, Adv. in Appl. Math., 29 (2002), pp. 412–426.
36.
V. Kann, S. Khanna, J. Lagergren, and A. Panconesi, On the hardness of approximating Max k‐Cut and its dual, Chicago J. Theoret. Comput. Sci., 1997, article 2.
37.
H. Karloff, How good is the Goemans–Williamson MAX‐CUT algorithm?, SIAM J. Comput., 29 (1999), pp. 336–350.
38.
R. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85–103.
39.
S. Khot, On the power of unique 2‐prover 1‐round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 767–775.
40.
S. Khot and O. Regev, Vertex Cover might be hard to approximate to within $2-\epsilon$, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity, 2003.
41.
S. Khot and N. Vishnoi, The Unique Games Conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1., in Proceedings of the 46rd Annual IEEE Symposium on Foundations of Computer Science, 2005.
42.
H. König, C. Schütt, and N. Tomczak‐Jaegermann, Projection constants of symmetric spaces and variants of Khintchine’s inequality, J. Reine Angew. Math., 511 (1999), pp. 1–42.
43.
M. Lewin, D. Livnat, and U. Zwick, Improved rounding techniques for the MAX‐2SAT and MAX‐DICUT problems, in Proceedings of the 9th Annual Conference on Integer Programming and Combinatorial Optimization, Springer‐Verlag, Berlin, 2002, pp. 67–82.
44.
K. Matulef, R. O’Donnell, R. Rubinfeld, and R. Servedio, Testing Linear Threshold Functions, manuscript.
45.
E. Mossel, Lecture Notes for Stat$206$A, Sept. 8, 2005, http://www.stat.berkeley.edu/∼mossel/teach/206af05/scribes/sep8.ps.
46.
E. Mossel and R. O’Donnell, On the noise sensitivity of monotone functions, in Trends in Mathematics: Mathematics and Computer Science II, B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem, eds., Birkhäuser, Basel, 2002.
47.
E. Mossel, R. O’Donnell, and K. Oleszkiewicz, Noise stability of functions with low influences: Invariance and optimality, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 21–30.
48.
E. Mossel, R. O’Donnell, O. Regev, B. Sudakov, and J. Steif, Non‐interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami‐Beckner inequality, Israel J. Math., 154 (2006), pp. 299–336.
49.
C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425–440.
50.
S. Sahni and T. Gonzales, P‐complete approximation problems, J. Assoc. Comput. Mach., 23 (1976), pp. 555–565.
51.
A. Samorodnitsky and L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 191–199.
52.
W. Sheppard, On the application of the theory of error to cases of normal distribution and normal correlation, Phil. Trans. Royal Soc. London, 192 (1899), pp. 101–168.
53.
M. Talagrand, On Russo’s approximate 0‐1 law, Ann. Probab., 22 (1994), pp. 1476–1387.
54.
M. Talagrand, How much are increasing sets positively correlated?, Combinatorica, 16 (1996), pp. 243–258.
55.
L. Trevisan, Approximation algorithms for Unique Games, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
56.
L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, Gadgets, approximation, and linear programming, SIAM J. Comput., 29 (2000), pp. 2074–2097.
57.
U. Zwick, Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX‐CUT and other problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 679–687.

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 319 - 357
ISSN (online): 1095-7111

History

Submitted: 4 April 2005
Accepted: 12 February 2007
Published online: 14 May 2007

MSC codes

  1. 68Q17

Keywords

  1. MAX‐CUT
  2. Unique Games
  3. hardness of approximation
  4. constraint satisfaction

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media