Hardness of approximate hypergraph coloring

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1663-1686

  Guruswami, Venkatesan ^a   Håstad, Johan ^b   Sudan, Madhu ^c  

^a University of Washington   (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Covering PCP; Graph coloring; Hardness of approximations; Hypergraph coloring; PCP; Set splitting

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

GRAPH COLORING; HYPERGRAPH COLORING; PROBABILISTIC CHECKABLE PROOF;

COMPUTATIONAL COMPLEXITY;

EID: 0036766888     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700377165     Document Type: Article

References (29)

1. N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh, Coloring 2-colorable hypergraphs with a sublinear number of colors, Nordic J. Comput., 3 (1996), pp. 425-439.
2. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. System Sci., 54 (1997), pp. 317-331.
3. S. Arora and C. Lund, Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, Dorit Hochbaum, ed., PWS Publishing, Boston, 1996.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
5. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
6. J. Beck, On 3-chromatic hypergraphs, Discrete Math., 24 (1978), pp. 127-137.
7. J. Beck, An algorithmic approach to the Lovász local lemma, Random Structures Algorithms, 2 (1991), pp. 343-365.
8. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs, and nonapproximability-towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
9. A. Blum and D. R. Karger, Improved approximation for graph coloring. Inform. Process. Lett., 61 (1997), pp. 49-53.
10. H. Chen and A. Frieze, Coloring bipartite hypergraphs, in Proceedings of the 5th IPCO, Lecture Notes in Comput. Sci. 1084, Springer-Verlag, New York, 1996, pp. 345-358.
11. P. Erdös, On a combinatorial problem, Nordisk Mat. Tidskr., 11 (1963), pp. 5-10.
12. U. Feige and J. Kilian, Zero-knowledge and the chromatic number, J. Comput. System Sci., 57 (1998), pp. 187-199.
13. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42 (1995), pp. 1115-1145.
14. V. Guruswami, Inapproximability results for set splitting and satisfiability problems with no mixed clauses, in Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Comput. Sci. 1913, Springer-Verlag, Berlin, 2000, pp. 155-166; Algorithmica, to appear.
15. V. Guruswami, J. Håstad, and M. Sudan, Hardness of approximate hypergraph coloring. in Proceedings of 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 149-158.
16. V. Guruswami and S. Khanna, On the hardness of 4-coloring a 3-colorable graph, in Proceedings of the 15th Annual IEEE Conference on Computational Complexity. Florence, 2000, pp. 188-197.
17. J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
18. J. Holmerin, Vertex cover on 4-regular hyper-graphs is hard to approximate within (2 - ε), in Proceedings of the 34th ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 544-552.
19. D. R. Karger, R. Motwani, and M. Sudan, Approximate graph coloring using semidefinite programming, J. ACM, 45 (1998), pp. 246-265.
20. S. Khanna, N. Linial, and S. Safra, On the hardness of approximating the chromatic number, Combinatorica, 20 (2000), pp. 393-415.
21. S. Khot, Hardness results for approximate hypergraph coloring, in Proceedings of the 34th ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 351-359.
22. M. Krivelevich and B. Sudakov, Approximate coloring of uniform hypergraphs, in Proceedings of the 6th European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1461, Springer-Verlag, New York, 1998, pp. 477-489.
23. L. Lovász, Coverings and colorings of hypergraphs, in Proceedings of the 4th Southeastern Conference on Combinatories, Graph Theory, and Computing, Utilitas Mathematica Publishing, Winnipeg, 1973, pp. 3-12.
24. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
25. C. McDiarmid, A random recoloring method for graphs and hypergraphs, Combin. Probab. Comput., 2 (1993), pp. 363-365.
26. C. McDiarmid, Hypergraph coloring and the Lovász local lemma, Discrete Math., 167/168 (1997), pp. 481-486.
27. J. Radhakrishnan and A. Srinivasan, Improved bounds and algorithms for hypergraph 2-coloring, Random Structures Algorithms, 16 (2000), pp. 4-32.
28. R. Raz, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
29. J. H. Spencer, Coloring n-sets red and blue, J. Combin. Theory Ser. A, 30 (1981), pp. 112-113.