A Note on First-Fit Coloring of Interval Graphs |
| |
Authors: | N S Narayanaswamy R Subhash Babu |
| |
Institution: | (1) Department of Computer Science and Engineering, Indian Institute of Technology-Madras, Chennai, 600036, India |
| |
Abstract: | We apply the Column Construction Method (Varadarajan et al., Proceedings of the Fifteenth Annual ACM-SIAM Symposium On Discrete
Algorithms, pp. 562–571, 2004) to a minimal clique cover of an interval graph to obtain a new proof that First-Fit is 8-competitive for online coloring
interval graphs. This proof also yields a new discovery that in each minimal clique cover of an interval graph G, there is a clique of size . |
| |
Keywords: | First fit for online graph coloring Competitive analysis Column construction method |
本文献已被 SpringerLink 等数据库收录! |