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
Recommended Reading
Adamy U, Erlebach T (2003) Online coloring of intervals with bandwidth. In: Proceedings of the first international workshop on approximation and online algorithms (WAOA2003), Budapest, Hungary, pp 1–12
Azar Y, Fiat A, Levy M, Narayanaswamy NS (2006) An improved algorithm for online coloring of intervals with bandwidth. Theor Comput Sci 363(1):18–27
Bar-Noy A, Motwani R, Naor J (1992) The greedy algorithm is optimal for on-line edge coloring. Inf Process Lett 44(5):251–253
Chrobak M, Ślusarek M (1988) On some packing problems relating to dynamical storage allocation. RAIRO J Inf Theory Appl 22:487–499
Epstein L, Levin A (2012) On the max coloring problem. Theor Comput Sci 462(1):23–38
Epstein L, Levy M (2005) Online interval coloring and variants. In: Proceedings of the 32nd international colloquium on automata, languages and programming (ICALP2005), Lisbon, Portugal, pp 602–613
Epstein L, Levy M (2008) Online interval coloring with packing constraints. Theor Comput Sci 407(1–3):203–212
Epstein L, Levin A, Woeginger GJ (2011) Graph coloring with rejection. J Comput Syst Sci 77(2):439–447
Gyárfás A, Lehel J (1991) Effective on-line coloring of P5-free graphs. Combinatorica 11(2):181–184
Kierstead HA (1988) The linearity of first-fit coloring of interval graphs. SIAM J Discret Math 1(4):526–530
Kierstead HA, Trotter WT (1981) An extremal problem in recursive combinatorics. Congr Numer 33:143–153
Kierstead HA, Smith DA, Trotter WT (2013) Manuscript. https://math.la.asu.edu/~halk/Publications/biwall6.pdf
Leonardi S, Vitaletti A (1998) Randomized lower bounds for online path coloring. In: Proceedings of the second international workshop on randomization and approximation techniques in computer science (RANDOM’98), Barcelona, Spain, pp 232–247
Nonner T (2011) Clique clustering yields a PTAS for max-coloring interval graphs. In: Proceedings of the 38th international colloquium on automata, languages and programming (ICALP2011), Zurich, Switzerland, pp 183–194
Pemmaraju S, Raman R, Varadarajan KS (2011) Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans Algorithms 7(3):35
Trotter WT (2014) Current research problems: first fit colorings of interval graphs. http://people.math.gatech.edu/~trotter/rprob.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Epstein, L. (2016). Online Interval Coloring. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_264
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_264
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering