Online interval coloring with packing constraints

Leah Epstein, Meital Levy

Research output: Contribution to journalArticlepeer-review


We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth problem.

Original languageEnglish
Pages (from-to)203-212
Number of pages10
JournalTheoretical Computer Science
Issue number1-3
StatePublished - 6 Nov 2008


  • Bin packing
  • Interval coloring
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Online interval coloring with packing constraints'. Together they form a unique fingerprint.

Cite this