Coloring k-colorable graphs using relatively small palettes

Journal of Algorithms

Volumn 45, Issue 1, 2002, Pages 72-90

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

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Graph coloring; Semidefinite programming

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS; MATHEMATICAL PROGRAMMING; MAXIMUM PRINCIPLE; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; SET THEORY; TIME DOMAIN ANALYSIS;

COLORABLE GRAPHS; COLORING ALGORITHM; POLYNOMIAL TIME; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 0036811821     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00217-1     Document Type: Article

References (14)

1. N. Alon, N. Kahale, Approximating the independence number via the θ-function, Math. Program. 80 (1998) 253-264.
2. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61 (1997) 49-53.
3. A. Blum, New approximation algorithms for graph coloring, J. ACM 41 (1994) 470-516.
4. U. Feige, J. Kilian, Zero knowledge and the chromatic number, J. Comput. System Sci. 57 (2) (1998) 187-199.
5. V. Guruswami, S. Khanna, On the hardness of 4-coloring a 3-colorable graph, in: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, 2000, pp. 188-197.
6. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 2nd ed., Springer, 1993.
7. M.M. Halldórsson, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993) 19-23.
8. S. Khanna, N. Linial, S. Safra, On the hardness of approximating the chromatic number, Combinatorica 20 (2000) 393-415.
9. D. Karger, R, Motwani, M. Sudan, Approximate graph coloring by semidefinite programming, J. ACM 45 (1998) 246-265.
10. M. Krievelevich, R. Nathaniel, B. Sudakov, Approximate coloring and maximum independent set in 3-uniform hypergrapghs, J. Algorithms 41 (2000) 99-113.
11. M. Krivelevich, B. Sudakov, Approximate coloring of uniform hypergraphs, in: Proceedings of the 6th Annual European Symposium on Algorithms, Venice, Italy, 1998, pp. 477-489.
12. L. Lovisz, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory IT-25 (1979) 1-7.
13. S. Mahajan, H. Ramesh, Derandomizing approximation algorithms based on semidefinite programming, SIAM J. Comput. 28 (1999) 1641-1663.
14. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM 30 (1983) 729-735.