Abstract
Approximate graph coloring takes as input a graph and returns a legal coloring which is not necessarily optimal. We improve the performance guarantee, or worst-case ratio between the number of colors used and the minimum number of colors possible, toO(n(log logn)3/(logn)3), anO(logn/log logn) factor better than the previous best-known result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garey, M. R., and Johnson, D. S., The complexity of near-optimal graph coloring,J. Assoc. Comput. Mach.,23 (1976), 43–49.
Johnson, D. S., Worst-case behavior of graph-coloring algorithms,Proc. 5th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, 1974, pp. 513–528.
Linial, N., Saks, M., and Wigderson, A., personal communication.
Raghavan, P., personal communication.
Wigderson, A., Improving the performance guarantee of approximate graph coloring,J. Assoc. Comput. Mach.,30 (1983), 729–735.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
The work of the first author was supported by Air Force Grant AFOSR-86-0078 and NSF PYI Grant 8657527-CCR. The work of the second author was supported by a National Science Foundation Graduate Fellowship.
Rights and permissions
About this article
Cite this article
Berger, B., Rompel, J. A better performance guarantee for approximate graph coloring. Algorithmica 5, 459–466 (1990). https://doi.org/10.1007/BF01840398
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840398