Online interval coloring and variants

Leah Epstein, Meital Levy

Research output: Contribution to journalConference articlepeer-review


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 band-width. This improves the lower bound of 3 that follows from the tight results for interval coloring without bandwidth presented in [9].

Original languageEnglish
Pages (from-to)602-613
Number of pages12
JournalLecture Notes in Computer Science
StatePublished - 2005
Event32nd International Colloquium on Automata, Languages and Programming, ICALP 2005 - Lisbon, Portugal
Duration: 11 Jul 200515 Jul 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Online interval coloring and variants'. Together they form a unique fingerprint.

Cite this