Abstract
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without bandwidth and a new problem called lazy online coloring again with and without bandwidth. We consider both general interval graphs and unit interval graphs. Specifically, we establish the difference between the two main problems which are interval coloring with and without bandwidth. We present the first non-trivial lower bound of 3.2609 for the problem with bandwidth. This improves the lower bound of 3 that follows from the tight results for interval coloring without bandwidth presented in [9].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 1–12. Springer, Heidelberg (2005)
Boyar, J., Epstein, L., Favrholdt, L.M., Kohrt, J.S., Larsen, K.S., Pedersen, M.M., Wøhlk, S.: The maximum resource bin packing problem (manuscript)
Chrobak, M., Ślusarek, M.: On some packing problems relating to dynamical storage allocation. RAIRO Journal on Information Theory and Applications 22, 487–499 (1988)
Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Information Processing Letters 55(2), 99–104 (1995)
Erlebach, T., Spieksma, F.C.R.: Interval selection: applications, algorithms, and lower bounds. J. Algorithms 46(1), 27–53 (2003)
Jensen, T.R., Toft, B.: Graph coloring problems. Wiley, Chichester (1995)
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., Qin, J.: Coloring interval graphs with First-Fit. SIAM Journal on Discrete Mathematics 8, 47–57 (1995)
Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143–153 (1981)
Narayanaswamy, N.S.: Dynamic storage allocation and online colouring interval graphs. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 329–338. Springer, Heidelberg (2004)
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)
Rabinovitch, I.: The scott-suppes theorem on semiorders. J. Math. Psych. 15, 209–212 (1977)
Scott, D., Suppes, P.: Foundational aspects of theories of measurement. J. Symbolic Logic 23, 113–128 (1958)
Seiden, S.S.: On the online bin packing problem. Journal of the ACM 49(5), 640–671 (2002)
Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logist. 41(4), 579–585 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., Levy, M. (2005). Online Interval Coloring and Variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_49
Download citation
DOI: https://doi.org/10.1007/11523468_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)