An improved randomized on-line algorithm for a weighted interval selection problem
From MaRDI portal
Recommendations
Cited in
(16)- Online interval scheduling: Randomized and multiprocessor cases
- Online interval scheduling with a bounded number of failures
- Online C-benevolent job scheduling on multiple machines
- Improved randomized online scheduling of intervals and jobs
- Online interval scheduling to maximize total satisfaction
- Online interval scheduling on two related machines: the power of lookahead
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- Improved Randomized Results for That Interval Selection Problem
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- Online selection of intervals and t-intervals
- Interval selection: Applications, algorithms, and lower bounds
- scientific article; zbMATH DE number 2080249 (Why is no real title available?)
- Interval scheduling on related machines
- Any-order online interval selection
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Improved randomized results for the interval selection problem
This page was built for publication: An improved randomized on-line algorithm for a weighted interval selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464426)
