A coloring algorithm for interval graphs

  • Maciej Slusarek
Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)


We devise a new optimal on-line coloring algorithm for interval graphs. Then we exhibit how it can be used to the construction of a polynomial time approximation strategy for the NP-hard dynamic storage allocation problem. Previously Chrobak, Slusarek, and Woodall applied the suboptimal greedy coloring (first fit) to the analysis of a certain allocation strategy. Due to that analysis (only partially carried out) the performance ratio of their allocation algorithm lies within [4.45, 40]. The new strategy decribed here achieves the performance ratio of 3.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CS]
    M. Chrobak, M. Slusarek, On some packing problem related to dynamic storage allocation, RAIRO Informatique Théorique et Applications, 22 (1988), 4, 487–499.Google Scholar
  2. [GJ]
    M.R.Garey, D.S.Johnson, Computers and Intractability, Freeman, 1979.Google Scholar
  3. [K]
    H.A.Kierstead, The Linearity of First-Fit Coloring of Interval Graphs, manuscript, 1988.Google Scholar
  4. [KT]
    H.A. Kierstead, W.T. Trotter, An extremal problem in recursive combinatorics, Congressus Numerantium 33 (1981), 143–153.Google Scholar
  5. [R]
    J.M. Robson, Bounds for some functions concerning dynamic storage allocation, JACM 21 (1974), 491–499.Google Scholar
  6. [S1]
    M. Slusarek, NP-completeness of storage allocation, Jagiellonian U. Scientific Papers, s. Informatics, 3 (1987), 7–18.Google Scholar
  7. [S2]
    M. Slusarek, An off-line storage allocation algorithm, IPL 24 (1987), 71–75.Google Scholar
  8. [S3]
    M.Slusarek, A lower bound for the wall problem, manuscript, 1988.Google Scholar
  9. [W]
    D.R.Woodall, Problem No. 4, in Combinatorics (Proc. British Combinatorial Conference 1973), London Math. Soc. Lecture Notes Series 13, T.P. McDonough and V.C. Mavron, Eds, Cambridge University Press, 1974, p. 202.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Maciej Slusarek
    • 1
  1. 1.Department of Computer ScienceJagiellonian UniversityKrakowPoland

Personalised recommendations