On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Lower bounds for on-line graph coloring
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Algorithm Design
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Space-constrained interval selection
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
A t-interval is a union of at most t half-open intervals on the real line. An interval is the special case where t=1. Requests for contiguous allocation of a linear resource can be modeled as a sequence of t-intervals. We consider the problems of online selection of intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among others. We derive lower bounds and (almost) matching upper bounds on the competitive ratios of randomized algorithms for selecting intervals, 2-intervals and t-intervals, for any t2. While offline t-interval selection has been studied before, the online version is considered here for the first time.