Pages that link to "Item:Q1612009"
From MaRDI portal
The following pages link to Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009):
Displayed 3 items.
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)