On advice complexity of the \(k\)-server problem under sparse metrics (Q2868631)
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 advice complexity of the k-server problem under sparse metrics |
scientific article; zbMATH DE number 6239168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On advice complexity of the \(k\)-server problem under sparse metrics |
scientific article; zbMATH DE number 6239168 |
Statements
On Advice Complexity of the k-server Problem under Sparse Metrics (English)
0 references
17 December 2013
0 references
0 references
0.997308611869812
0 references
0.9055519104003906
0 references
0.9036954641342164
0 references
0.8918830752372742
0 references
0.8858775496482849
0 references
