Order

, Volume 25, Issue 1, pp 49–53 | Cite as

A Note on First-Fit Coloring of Interval Graphs

Article

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 \(\frac{\omega(G)}{8}\).

Keywords

First fit for online graph coloring Competitive analysis Column construction method 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chrobak, M., Ślusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Inform. Theor. Appl. 22, 487–499 (1988)MathSciNetGoogle Scholar
  2. 2.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, London (1980)MATHGoogle Scholar
  3. 3.
    Kierstead, H.A., Qin, J.: Coloring interval graphs with first-fit. Discrete Math. 144, 47–57 (1995)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 1(4), 526–530 (1988)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Varadarajan, K., Pemmaraju, S.V., Raman, R.: Buffer minimization using max-coloring. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium On Discrete Algorithms, pp. 562–571, New Orleans, 11–14 January 2004Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology-MadrasChennaiIndia

Personalised recommendations