A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the competitive ratio of the work function algorithm for the \(k\)-server problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4010306 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The \(k\)-server problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the <i>k</i> -server conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3977465 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast work function algorithm for solving the \(k\)-server problem / rank | |||
Normal rank | |||
Revision as of 15:19, 21 July 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
