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
Bounding the Power of Preemption in Randomized Scheduling
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
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
Theoretical Computer Science
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Journal of Scheduling - Special issue: On-line algorithm part I
Algorithm Design
SIAM Journal on Computing
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Improved randomized results for the interval selection problem
Theoretical Computer Science
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
| 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. In this paper we study the problems of online selection of intervals and t-intervals. 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.