A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-019-00493-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2991644895 / rank | |||
Normal rank | |||
Revision as of 00:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the work function algorithm for the \(k\)-server problem |
scientific article |
Statements
A new upper bound on the work function algorithm for the \(k\)-server problem (English)
0 references
3 February 2020
0 references
competitive analysis
0 references
\(k\)-server problem
0 references
on-line algorithms
0 references
work function
0 references
