Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized algorithms for on-line scheduling problems: How low can't you go? |
scientific article |
Statements
Randomized algorithms for on-line scheduling problems: How low can't you go? (English)
0 references
28 August 2002
0 references
0 references
0 references
0 references
