A better performance guarantee for approximate graph coloring
- 212 Downloads
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.
Key wordsApproximation algorithms Graph coloring Performance guarantee
Unable to display preview. Download preview PDF.
- [J]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.Google Scholar
- [LSW]Linial, N., Saks, M., and Wigderson, A., personal communication.Google Scholar
- [R]Raghavan, P., personal communication.Google Scholar