On the advice complexity of the \(k\)-server problem (Q2396827): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2017.01.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2578333369 / rank | |||
Normal rank | |||
Revision as of 23:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the advice complexity of the \(k\)-server problem |
scientific article |
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
