Conditional hardness for approximate coloring

SIAM Journal on Computing

Volumn 39, Issue 3, 2009, Pages 843-873

  Dinur, Irit ^a,b   Mossel, Elchanan ^c   Regev, Oded ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Graph coloring; Hardness of approximation; Unique games

Indexed keywords

GRAPH COLORING; GRAPH G; HARDNESS OF APPROXIMATION; HARDNESS RESULT; NOISE STABILITY; NP-HARD; OPTIMALITY; TIGHT BOUND; UNIQUE GAMES;

COLORING; COMPUTATIONAL COMPLEXITY; GAME THEORY; HARDNESS; LABELS;

GRAPH THEORY;

EID: 69049114323     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/07068062X     Document Type: Article

References (37)

1. N. Alon, I. Dinur, E. Friedgut, and B. Sudakov, Graph products, Fourier analysis and spectral techniques, Geom. Funct. Anal., 14 (2004), 913-940.
2. S. Arora, E. Chlamtac, and M. Charikar, New approximation guarantee for chromatic number, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, 215-224.
3. S. Arora and C. Lund, Hardness of approximations, in Approximation Algorithms for NPHard Problems, D. S. Hochbaum, ed., PWS, Boston, 1995, Chap. 10, 399-446.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), 501-555.
5. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), 70-122.
6. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PARs, and nonapproximability- towards tight results, SIAM J. Comput., 27 (1998), 804-915.
7. I. Benjamini, G. Kalai, and O. Schramm, Noise sensitivity of Boolean functions and applications to percolation, Inst. Hautes Études Sci. Publ. Math., 90 (1999), 5-43.
8. A. Blum, New approximation algorithms for graph coloring, J. ACM, 41 (1994), 470-516.
9. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett., 61 (1997), 49-53.
10. C. Borell, Geometric bounds on the Ornstein-Uhlenbeck velocity process, Z. Wahrsch. Verw. Gebiete, 70 (1985), 1-13.
11. J. Bourgain, An appendix to "Sharp thresholds of graph properties, and the k-SAT problem, " by E. Friedgut, J. Amer. Math. Soc., 12 (1999), 1017-1054.
12. J. Bourgain, On the distribution of the Fourier spectrum of boolean functions, Israel J.Math., 131 (2002), 269-276.
13. 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, 205-214.
14. E. Chlamtac, K. Makarychev, and Y. Makarychev, How to play unique games using embeddings, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, 2006, 687-696.
15. I. Dinur, E. Friedgut, and O. Regev, Independent sets in graph powers are almost contained in juntas, Geom. Funct. Anal., 18 (2008), 77-97.
16. I. Dinur and S. Safra, On the hardness of approximating minimum vertex cover, Ann. of Math. (2), 162 (2005), 439-485.
17. U. Feige, M. Langberg, and G. Schechtman, Graphs with tiny vector chromatic numbers and huge chromatic numbers, SIAM J. Comput., 33 (2004), 1338-1368.
18. E. Friedgut, Sharp thresholds of graph properties, and the k-SAT problem, J. Amer. Math. Soc., 12 (1999), 1017-1054.
19. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc., 124 (1996), 2993-3002.
20. M. FÜrer, Improved hardness results for approximating the chromatic number, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, 414-421.
21. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), 1115-1145.
22. A. Gupta and K. Talwar, Approximating unique games, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2006, 99-106.
23. V. Guruswami and S. Khanna, On the hardness of 4-coloring a 3-colorable graph, SIAM J. Discrete Math., 18 (2004), 30-40.
24. E. Halperin, R. Nathaniel, and U. Zwick, Coloring k-colorable graphs using relatively small palettes, J. Algorithms, 45 (2002), 72-90.
25. J. Ha°stad, Some optimal inapproximability results, J. ACM, 48 (2001), 798-859.
26. J. Kahn, G. Kalai, and N. Linial, The influence of variables on boolean functions, in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988, 68-80.
27. D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), 246-265.
28. S. Khanna, N. Linial, and S. Safra, On the hardness of approximating the chromatic number, Combinatorica, 20 (2000), 393-415.
29. S. Khot, Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, 600-609.
30. 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, 767-775.
31. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?, SIAM J. Comput., 37 (2007), 319-357.
32. S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2-å, J. Comput. System Sci., 74 (2008), 335-349.
33. E. Mossel, R. O'Donnell, and K. Oleszkiewicz, Noise stability of functions with low influences: Invariance and optimality, Ann. of Math. (2), to appear.
34. M. Talagrand, On Russo's approximate 0-1 law, Ann. Probab., 22 (1994), 1576-1587.
35. M. Talagrand, How much are increasing sets positively correlated?, Combinatorica, 16 (1996), 243-258.
36. L. Trevisan, Approximation algorithms for unique games, Theory Comput., 4 (2008), 111- 128.
37. A. Wigderson, Improving the performance for approximate graph coloring, J. ACM, 30 (1983), 729-735.