Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation and Online Algorithms

WAOA 2003: Approximation and Online Algorithms pp 1–12Cite as

Online Coloring of Intervals with Bandwidth

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2909))

Abstract

Motivated by resource allocation problems in communication networks, we consider the problem of online interval coloring in the case where the intervals have weights in (0,1] and the total weight of intersecting intervals with the same color must not exceed 1. We present an online algorithm for this problem that achieves a constant competitive ratio. Our algorithm is a combination of an optimal online algorithm for coloring interval graphs and First-Fit coloring, for which we generalize the analysis of Kierstead to the case of non-unit bandwidth.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theoretical Computer Science 221(1-2), 19–39 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: Proceedings of the Second Workshop on Optics and Computer Science (WOCS), part of IPPS 1997 (1997)

    Google Scholar 

  3. Chrobak, M., Ślusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Informatique Théoretique et Applications 22, 487–499 (1988)

    MATH  Google Scholar 

  4. Erlebach, T., Jansen, K.: Off-line and on-line call-scheduling in stars and trees. In: Möhring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 199–213. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  5. Feldmann, A.: On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1995)

    Google Scholar 

  6. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  7. Gyárfás, A., Lehel, J.: Online and First-Fit colorings of graphs. Journal of Graph Theory 12, 217–227 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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 

  9. Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  12. Witsenhausen, H.S.: On Woodall’s interval problem. Journal of Combinatorial Theory (Series A) 21, 222–229 (1976)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Theoretical Computer Science, ETH Zürich, 8092, Zürich, Switzerland

    Udo Adamy

  2. Computer Engineering and Networks Laboratory, ETH Zürich, 8092, Zürich, Switzerland

    Thomas Erlebach

Authors
  1. Udo Adamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Erlebach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adamy, U., Erlebach, T. (2004). Online Coloring of Intervals with Bandwidth. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24592-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24592-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation