SIAM Journal on Computing
An efficient approximation scheme for variable-sized bin packing
SIAM Journal on Computing
The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
An on-line algorithm for variable-sized bin packing
Acta Informatica
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
Coloring interval graphs with First-Fit
Discrete Mathematics
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
On the online bin packing problem
Journal of the ACM (JACM)
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
SIAM Journal on Discrete Mathematics
New Bounds for Variable-Sized Online Bin Packing
SIAM Journal on Computing
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We consider online coloring of intervals with bandwidth in a setting where colors have variable capacities. Whenever the algorithm opens a new color, it must choose the capacity for that color and cannot change it later. The goal is to minimize the total capacity of all the colors used. We consider the bounded model, where all capacities must be chosen in the range (0,1], and the unbounded model, where the algorithm may use colors of any positive capacity. For the absolute competitive ratio, we give an upper bound of 14 and a lower bound of 4.59 for the bounded model, and an upper bound of 4 and a matching lower bound of 4 for the unbounded model. We also consider the offline version of these problems and show that the unbounded model is polynomially solvable, while the bounded model is NP-hard in the strong sense and admits a 3.6-approximation algorithm