A lower bound for randomized on-line scheduling algorithms (Q1336752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for randomized on-line scheduling algorithms |
scientific article |
Statements
A lower bound for randomized on-line scheduling algorithms (English)
0 references
19 September 1995
0 references
combinatorial problems
0 references
on-line algorithms
0 references
worst case bounds
0 references
scheduling
0 references
randomization
0 references
