A lower bound for randomized on-line scheduling algorithms (Q1336752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound for randomized on-line scheduling algorithms |
scientific article; zbMATH DE number 681772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for randomized on-line scheduling algorithms |
scientific article; zbMATH DE number 681772 |
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
0.923206627368927
0 references
0.9053096771240234
0 references
0.8950157761573792
0 references
0.8882004618644714
0 references
