Approximate coloring of uniform hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 477-489

  Krivelevich, Michael ^a   Sudakov, Benny ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLORING; POLYNOMIAL APPROXIMATION;

ALGORITHMIC PROBLEMS; APPROXIMATE SOLUTION; CHROMATIC NUMBER; GRAPH COLORINGS; PERFORMANCE RATIO; POLYNOMIAL-TIME; POSITIVE SIDES; R-UNIFORM HYPERGRAPHS;

GRAPH THEORY;

EID: 84896794671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_40     Document Type: Conference Paper

References (19)

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), 425-439.
2. N. Alon and J. H. Spencer, The probabilistic method, Wiley, New York, 1992.
3. B. Berger and 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 and 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 Applied Math. 69 (1996), 257-270.
8. J. Brown and D. Corneil, Graph properties and hypergraph colourings, Discrete Math. 98 (1991), 81-93.
9. H. Chen and A. Frieze, Coloring bipartite hypergraphs, in: Proc. 5 Intern. IPCO Conference, Lecture Notes in Comp. Sci. 1084 (1996), 345-358.
10. th Annual IEEE Conf. on Computational Complexity, 1996.
11. M. M. Halldórsson, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993), 19-23.
12. th IEEE FOCS, IEEE (1996), 627-636.
13. D. S. Johnson, Worst case behaviour of graph coloring algorithms, in: Proc. 5th S.E. Conf. on Combinatorics, Graph Theory and Computing, Congr. Numer. 10 (1974), 512-527.
14. D. Karger, R. Motwani and M. Sudan, Approximate graph coloring by semidefinite programming, in: Proc. 26 ACM FOCS, ACM Press (1994), 2-13.
15. P. Kelsen, S. Mahajan and H. Ramesh, Approximate hypergraph coloring, in: Proc. 5 Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comp. Sci. 1097 (1996), 41-52.
16. n Israeli Symposium on Theor. Comp. Sci., IEEE (1992), 250-260.
17. th S.E. Conf. on Combinatorics, Graph Theory and Computing, 1973, Utilitas Math., 3-12.
18. K. Phelps and V. Rödl, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Combinatorica 4 (1984), 79-88.
19. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM 30 (1983), 729-735.