论文信息 - A Still Better Performance Guarantee for Approximate Graph Coloring - 字舞流文

A Still Better Performance Guarantee for Approximate Graph Coloring

M. Halldórsson

[1] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.

[2] Magnús M. Halldórsson,et al. Lower bounds for on-line graph coloring , 1992, SODA '92.

[3] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[4] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.