A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction (Q340306)
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 approach to solve the k-server problem based on network flows and flow cost reduction |
scientific article; zbMATH DE number 6652553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction |
scientific article; zbMATH DE number 6652553 |
Statements
A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction (English)
0 references
14 November 2016
0 references
on-line problems
0 references
\(k\)-server problem
0 references
optimal off-line algorithm
0 references
work function algorithm
0 references
implementation
0 references
network flows
0 references
cost reduction
0 references
experiments
0 references
0.9006328582763672
0 references
0.9003802537918091
0 references
0.889601469039917
0 references
0.8513896465301514
0 references
0.8205233216285706
0 references
