Any-order online interval selection
From MaRDI portal
Publication:6574946
DOI10.1007/978-3-031-49815-2_13MaRDI QIDQ6574946
Christodoulos Karavasilis, Allan Borodin
Publication date: 19 July 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online scheduling with interval conflicts
- Online selection of intervals and \(t\)-intervals
- On-line scheduling of equal-length intervals on parallel machines
- The \(k\)-server problem
- Lower bounds for two call control problems
- On sum coloring and sum multi-coloring for restricted families of graphs
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A note on scheduling equal-length jobs to maximize throughput
- Randomized online interval scheduling
- A short proof that `proper = unit'
- On-line scheduling of jobs with fixed start and end times
- A lower bound for two-server balancing algorithms
- Scheduling equal-length jobs on identical parallel machines
- Online C-benevolent job scheduling on multiple machines
- Note on scheduling intervals on-line
- The CNN problem and other \(k\)-server variants
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Improved randomized online scheduling of intervals and jobs
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
- An improved randomized on-line algorithm for a weighted interval selection problem
- On the competitive ratio for online facility location
- Online Knapsack Problem with Removal Cost
- Admission control to minimize rejections and online set cover with repetitions
- Efficient On-Line Call Control Algorithms
- Interval scheduling: A survey
- Improved Randomized Results for That Interval Selection Problem
- Space-Constrained Interval Selection
- The online 𝑘-taxi problem
This page was built for publication: Any-order online interval selection
