Three-quarter approximation for the number of unused colors in graph coloring

Information Sciences

Volumn 114, Issue 1-4, 1999, Pages 105-126

  Tzeng, Wen Guey ^a   King, Gow Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Approximation; Graph coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

GRAPH COLORING;

GRAPH THEORY;

EID: 0033102151     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(98)10058-0     Document Type: Article

References (11)

1. S. Arora, S. Safra, Approximating clique is NP-Complete, in: Proc. of The 33rd IEEE Symp. on Foundations of Computer Science, 1992.
2. A. Blum, Some tools for approximate 3-coloring, in: Proc. of The 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 554-562.
3. M. Demange, P. Grisoni, V.T. Paschos, Approximation results for the minimum graph coloring problem, Information Processing Letters 50 (1994) 19-23.
4. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
5. M. Garey, D. Johnson, L. Stockmeyer, Some simplified NP-Complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
6. A. Gibbons, Algorithmic Graph Theory, Cambridge Univ. Press, Cambridge, 1985.
7. R. Hassin, S. Lahav, Maximizing the number of unused colors in the vertex coloring problem, Information Processing Letters 52 (1994) 87-90.
8. P. Peterson, M. Loui, The general matching algorithm of Micali and Vazirani, Algorithmica (1988) 511-533.
9. C. Lund, M. Yanakakis, On the hardness of approximating minimization problems, in: Proc. 25th Annual ACM Symp. Theory of Computing, 1993, pp. 286-293.
10. A. Widgerson, Improving the performance guarantee for approximate graph coloring. J. ACM 30 (1983) 729-735.
11. C.K. Wong, L.T. Kou, L.J. Stockmeyer, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Commun. ACM 21 (1978) 135-139.