On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2467644617 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1305.2108 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:29, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the advice complexity of the \(k\)-server problem under sparse metrics |
scientific article |
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
