Separating online scheduling algorithms with the relative worst order ratio (Q2385472)
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: Separating online scheduling algorithms with the relative worst order ratio |
scientific article; zbMATH DE number 5200358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating online scheduling algorithms with the relative worst order ratio |
scientific article; zbMATH DE number 5200358 |
Statements
Separating online scheduling algorithms with the relative worst order ratio (English)
0 references
12 October 2007
0 references
Online algorithms
0 references
Relative worst order ratio
0 references
Scheduling
0 references
0 references
0.8776471614837646
0 references
0.8543733954429626
0 references
0.8110508322715759
0 references
0.809786856174469
0 references
