The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
Coloring interval graphs with First-Fit
Discrete Mathematics
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
The Ordered Open-End Bin-Packing Problem
Operations Research
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
Multidimensional bin packing algorithms
IBM Journal of Research and Development
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ACM SIGACT News
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online capacitated interval coloring
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
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.