Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 295-307 |
| Number of pages | 13 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3618 |
| DOIs | |
| State | Published - 2005 |
| Event | 30th International Symposium on Mathematical Foundations of Computer Science 2005, MFCS 2005 - Gdansk, Poland Duration: 29 Aug 2005 → 2 Sep 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science