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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theoretical Computer Science 221(1-2), 19–39 (1999)
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)
Chrobak, M., Ślusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Informatique Théoretique et Applications 22, 487–499 (1988)
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)
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)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Gyárfás, A., Lehel, J.: Online and First-Fit colorings of graphs. Journal of Graph Theory 12, 217–227 (1988)
Kierstead, H.A.: The linearity of First-Fit coloring of interval graphs. SIAM Journal on Discrete Mathematics 1(4), 526–530 (1988)
Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, Springer, Heidelberg (1998)
Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. SIAM Journal on Discrete Mathematics 8, 47–57 (1995)
Kierstead, H.A., Trotter Jr., W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143–153 (1981)
Witsenhausen, H.S.: On Woodall’s interval problem. Journal of Combinatorial Theory (Series A) 21, 222–229 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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