A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157)
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: A new upper bound on the work function algorithm for the k-server problem |
scientific article; zbMATH DE number 7161796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound on the work function algorithm for the \(k\)-server problem |
scientific article; zbMATH DE number 7161796 |
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
0.9286569356918336
0 references
0.9213975667953492
0 references
0.8917533755302429
0 references
