On the advice complexity of the \(k\)-server problem (Q2396827)
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: On the advice complexity of the k-server problem |
scientific article; zbMATH DE number 6723275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the advice complexity of the \(k\)-server problem |
scientific article; zbMATH DE number 6723275 |
Statements
On the advice complexity of the \(k\)-server problem (English)
0 references
26 May 2017
0 references
online algorithms
0 references
advice complexity
0 references
competitive analysis
0 references
\(k\)-server problem
0 references
0.9847456216812134
0 references
0.9286613464355468
0 references
0.9260204434394836
0 references
0.892020046710968
0 references
0.8920198678970337
0 references
