A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-019-00493-z / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126658342 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-019-00493-Z / rank | |||
Normal rank | |||
Latest revision as of 20:45, 17 December 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
0 references
