Approximate coloring of uniform hypergraphs

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 2-12

  Krivelevich, Michael ^a,b   Sudakov, Benny ^b  

^a RUTGERS UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

APPROXIMATION ALGORITHM; CHROMATIC NUMBER; GRAPH COLORING; HYPERGRAPHS;

ALGORITHMS;

EID: 0242583681     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00077-4     Document Type: Article

References (26)

1. N. Alon, P. Kelsen, S. Mahajan, H. Ramesh, Coloring 2-colorable hypergraphs with a sublinear number of colors, Nordic J. Comput. 3 (1996) 425-439.
2. N. Alon, J.H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
3. B. Berger, J. Rompel, A better performance guarantee for approximate graph coloring, Algorithmica 5 (1990) 459-466.
4. A. Blum, New approximation algorithms for graph coloring, J. ACM 31 (1994) 470-516.
5. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61 (1997) 49-53.
6. R. Boppana, M.M. Halldórsson, Approximating maximum independent sets by excluding subgraphs, Bit 32 (1992) 180-196.
7. J. Brown, The complexity of generalized graph colorings, Discrete Appl. Math. 69 (1996) 257-270.
8. J. Brown, D. Corneil, Graph properties and hypergraph colourings, Discrete Math. 98 (1991) 81-93.
9. H. Chen, A. Frieze, Coloring bipartite hypergraphs, in: Proc. 5th Intern. IPCO Conference, in: Lecture Notes in Comput. Sci, Vol. 1084, 1996, pp. 345-358.
10. I. Dinur, O. Regev, C. Smyth, The hardness of 3-uniform hypergraph coloring, in: Proc. 43rd IEEE FOCS, IEEE Press, 2002, in press.
11. U. Feige, J. Kilian, Zero knowledge and the chromatic number, in: Proc. 11th Annual IEEE Conf. on Computational Complexity, 1996.
12. V. Guruswami, J. Håstad, M. Sudan, Hardness of approximate hypergraph coloring, in: Proc. 41st IEEE FOCS, IEEE Press, 2000, pp. 149-158.
13. M.M. Halldórsson, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993) 19-23.
14. 1-ε, in: Proc. 37th IEEE FOCS, IEEE Press, 1996, pp. 627-636.
15. T. Hofmeister, H. Lefmann, Approximating maximum independent sets in uniform hypergraphs, in: Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science, in: Lecture Notes in Comput. Sci., Vol. 1450, Springer-Verlag, 1998, pp. 562-570.
16. D.S. Johnson, Worst case behaviour of graph coloring algorithms, Proc. 5th S.E. Conf. on Combinatorics, Graph Theory Comput. 10 (1974) 512-527.
17. D. Karger, R. Motwani, M. Sudan, Approximate graph coloring by semidefinite programming, in: Proc. 35th IEEE FOCS, IEEE Press, 1994, pp. 2-13.
18. P. Kelsen, S. Mahajan, H. Ramesh, Approximate hypergraph coloring, in: Proc. 5th Scandinavian Workshop on Algorithm Theory, in: Lecture Notes in Comput. Sci., Vol. 1097, 1996, pp. 41-52.
19. S. Khanna, N. Linial, M. Safra, On the hardness of approximating the chromatic number, in: Proc. 2nd Israeli Symposium on Theor. Comp. Sci., IEEE Press, 1992, pp. 250-260.
20. S. Khot, Hardness results for approximate hypergraph coloring, in: Proc. 34th ACM STOC, ACM Press, 2002, pp. 351-359.
21. S. Khot, Hardness results for coloring 3-colorable 3-uniform hypergraphs, in: Proc. 43rd IEEE FOCS, IEEE, 2002.
22. M. Krivelevich, R. Nathaniel, B. Sudakov, Approximating coloring and maximum independent set in 3-uniform hypergraphs, J. Algorithms 41 (2001) 99-113, a preliminary version appeared, in: Proc. of the 12th Annual ACM-SIAM SODA, ACM Press, 2001, pp. 327-328.
23. M. Krivelevich, B. Sudakov, Approximate coloring of uniform hypergraphs, in: Proc. of the 6th Annual European Symposium on Algorithms (ESA '98), in: Lecture Notes in Comput. Sci., Vol. 1461, Springer-Verlag, 1998, pp. 477-489.
24. L. Lovász, Coverings and colorings of hypergraphs, Proc. 4th S.E. Conf. on Combinatorics, Graph Theory and Computing, Utilitas Math. (1973) 3-12.
25. K. Phelps, V. Rödl, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Combinatorica 4 (1984) 79-88.
26. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM 30 (1983) 729-735.