On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6674143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the advice complexity of the \(k\)-server problem under sparse metrics |
scientific article; zbMATH DE number 6674143 |
Statements
On the advice complexity of the \(k\)-server problem under sparse metrics (English)
0 references
12 January 2017
0 references
\(k\)-server problem
0 references
advice complexity
0 references
competitive analysis
0 references
0.997308611869812
0 references
0.9062533974647522
0 references
0.90420001745224
0 references
0.8913697600364685
0 references
0.8853455185890198
0 references
