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 band-width. This improves the lower bound of 3 that follows from the tight results for interval coloring without bandwidth presented in [9].
| Original language | English |
|---|---|
| Pages (from-to) | 602-613 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3580 |
| DOIs | |
| State | Published - 2005 |
| Event | 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005 - Lisbon, Portugal Duration: 11 Jul 2005 → 15 Jul 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science