Skip to main content
SpringerLink
Log in

Online Interval Coloring with Packing Constraints

  • Conference paper
Mathematical Foundations of Computer Science 2005 (MFCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3618))

Abstract

We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 1–12. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143(1-3), 238–251 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blitz, D., van Vliet, A., Woeginger, G.J.: Lower bounds on the asymptotic worst-case ratio of online bin packing algorithms. Unpublished manuscript (1996)

    Google Scholar 

  4. Caprara, A., Kellerer, H., Pferschy, U.: Approximation schemes for ordered vector packing problems. Naval Research Logistics 92, 58–69 (2003)

    Article  MathSciNet  Google Scholar 

  5. Chrobak, M., Ślusarek, M.: On some packing problems relating to dynamical storage allocation. RAIRO Journal on Information Theory and Applications 22, 487–499 (1988)

    MATH  Google Scholar 

  6. Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147–177 (1998)

    Google Scholar 

  7. Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 602–613. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Galambos, G., Kellerer, H., Woeginger, G.J.: A lower bound for online vector packing algorithms. Acta Cybernetica 10, 23–34 (1994)

    MathSciNet  Google Scholar 

  9. Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.C.: Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory (Series A) 21, 257–298 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  10. Jensen, T.R., Toft, B.: Graph coloring problems. Wiley, Chichester (1995)

    MATH  Google Scholar 

  11. Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA (1973)

    Google Scholar 

  12. Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM Journal on Discrete Mathematics 1(4), 526–530 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. SIAM Journal on Discrete Mathematics 8, 47–57 (1995)

    Article  MathSciNet  Google Scholar 

  14. Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143–153 (1981)

    MathSciNet  Google Scholar 

  15. Kou, L.T., Markowsky, G.: Multidimensional bin packing algorithms. IBM Journal on Research and Development 21, 443–448 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  16. Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 22(4), 522–550 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  17. Krause, K.L., Shen, V.Y., Schwetman, H.D.: Errata: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 24(3), 527–527 (1977)

    Article  MathSciNet  Google Scholar 

  18. Narayanaswamy, N.S.: Dynamic storage allocation and on-line colouring interval graphs. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 329–338. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Pemmaraju, S., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 562–571 (2004)

    Google Scholar 

  20. Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)

    Google Scholar 

  21. Yang, J., Leung, J.Y.-T.: The ordered open-end bin-packing problem. Oper. Res. 51(5), 759–770 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Haifa, 31905, Haifa, Israel

    Leah Epstein

  2. School of Computer Science, Tel-Aviv University, Israel

    Meital Levy

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meital Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L., Levy, M. (2005). Online Interval Coloring with Packing Constraints. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_26

Download citation

  • DOI: https://doi.org/10.1007/11549345_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation