Pages that link to "Item:Q2464426"
From MaRDI portal
The following pages link to An improved randomized on-line algorithm for a weighted interval selection problem (Q2464426):
Displayed 13 items.
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Online interval scheduling to maximize total satisfaction (Q2285162) (← links)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES (Q3434275) (← links)
- Improved Randomized Results for That Interval Selection Problem (Q3541101) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)