Coloring k-colorable graphs using smaller palettes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 319-326

  Halperin, Eran ^a   Nathaniel, Ram ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 35448990454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Noga Alon , Nabil Kahale, Approximating the independence number via the j -function, Mathematical Programming: Series A and B, v.80 n.3, p.253-264, Feb. 1, 1998 [doi>10.1007/BF01581168]
2. Avrim Blum , David Karger, An Õ(n3/14)-coloring algorithm for 3-colorable graphs, Information Processing Letters, v.61 n.1, p.49-53, Jan. 14, 1997 [doi>10.1016/S0020-0190(96)00190-1 ]
3. Avrim Blum, New approximation algorithms for graph coloring, Journal of the ACM (JACM), v.41 n.3, p.470-516, May 1994 [doi>10.1145/176584.176586]
4. Uriel Feige , Joe Kilian, Zero Knowledge and the Chromatic Number, Proceedings of the 11th Annual IEEE Conference on Computational Complexity, p.278, May 24-27, 1996
5. Venkatesan Guruswami , Sanjeev Khanna, On the Hardness of 4-Coloring a 3-Colorable Graph, Proceedings of the 15th Annual IEEE Conference on Computational Complexity, p.188, July 04-07, 2000
6. M. Grotschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1993. Second corrected edition.
7. Magnús M. Hallórsson, A still better performance guarantee for approximate graph coloring, Information Processing Letters, v.45 n.1, p.19-23, Jan. 25, 1993 [doi>10.1016/0020-0190(93)90246-6 ]
8. S. Khanna, N. Linial, and S. Safra. On the hardness of approximating the chromatic number. Combinatorica, 20:393-415, 2000.
9. David Karger , Rajeev Motwani , Madhu Sudan, Approximate graph coloring by semidefinite programming, Journal of the ACM (JACM), v.45 n.2, p.246-265, March 1998 [doi>10.1145/274787.274791]
10. Michael Krivelevich , Ram Nathaniel , Benny Sudakov, Approximating coloring and maximum independent sets in 3-uniform hypergraphs, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.327-328, January 07-09, 2001, Washington, D.C., United States
11. Michael Krivelevich , Benny Sudakov, Approximate Coloring of Uniform Hypergraphs, Certer for Discrete Mathematics & Theoretical Computer Science, 1998 Lov79 L. Lovasz On the shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25:1- 7, 1979.
12. Sanjeev Mahajan , H. Ramesh, Derandomizing Approximation Algorithms Based on Semidefinite Programming, SIAM Journal on Computing, v.28 n.5, p.1641-1663, April/May 1999 [doi>10.1137/S0097539796309326]
13. Avi Wigderson, Improving the performance guarantee for approximate graph coloring, Journal of the ACM (JACM), v.30 n.4, p.729-735, Oct. 1983 [doi>10.1145/2157.2158]