An Õ(n3/14)-coloring algorithm for 3-colorable graphs

Information Processing Letters

Volumn 61, Issue 1, 1997, Pages 49-53

  Blum, Avrim ^a   Karger, David ^b  

^a Carnegie Mellon University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Analysis of algorithms; Approximation algorithms; Graph coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY;

APPROXIMATION ALGORITHM; GRAPH COLORING; POLYNOMIAL TIME ALGORITHM; THREE-COLORABLE GRAPHS;

GRAPH THEORY;

EID: 0030737372     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(96)00190-1     Document Type: Article

References (9)

1. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 25 (1985) 27-46.
2. 0.4)-approximation algorithm for 3-coloring (and improved approximation algorithms for k-coloring), in: Proc. 21st Ann. ACM Symp. on Theory of Computing, Seattle (1989) 535-542.
3. A. Blum, New approximation algorithms for graph coloring, J. ACM 31 (3) (1994) 470-516.
4. M. Bellare and M. Sudan, Improved non-approximability results, in: Proc. 26th ACM Symp. on Theory of Computing (1994) 184-193.
5. S. Khanna, N. Linial and S. Safra, On the hardness of approximating the chromatic number, in: Proc. 2nd Israeli Symp. on Theory and Computing Systems (1992) 250-260.
6. D. Karger, R. Motwani and M. Sudan, Approximate graph coloring by semidefinite programming, in: Proc. 35th Ann. Symp. on Foundations of Computer Science, 1994.
7. B. Monien and E. Speckenmeyer, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform. 22 (1985) 115-123.
8. I. Schiermeyer, An approximation algorithm for 3-colorability, in: Proc. 21st Internat. Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1017 (Springer, Berlin, 1995) 146-151.
9. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM 30 (4) (1983) 729-735.