tlooto
Sign up
Computer ScienceMathematics

A still better performance guarantee for approximate graph coloring

Magnús M. Hallórsson

1993.1.25INFORMATION PROCESSING LETTERS

DOI: 10.1016/0020-0190(93)90246-6

tlooto Summary

An approximation algorithm for graph coloring is presented which achieves a performance guarantee of O(n( log log n) 2 (log n) 3 ) , a factor oflog log n improvement.

Abstract

Abstract is not available.

Citation format

HALLÓRSSON, Magnús M. A still better performance guarantee for approximate graph coloring. INFORMATION PROCESSING LETTERS, 1993, 45: 19–23.