Pages that link to "Item:Q1909593"
From MaRDI portal
The following pages link to Randomized online algorithms for maximizing busy time interval scheduling (Q1909593):
Displaying 8 items.
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Visiting infinitely often the unit interval while minimizing the idle time of high priority segments (Q2303307) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling (Q2780944) (← links)
