A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction

DOI10.1016/J.COR.2012.11.006zbMath1349.90172OpenAlexW2023952684MaRDI QIDQ340306

Tomislav Rudec, Robert Manger

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.006

zbMATH Keywords

experimentsnetwork flowsimplementation\(k\)-server problemwork function algorithmcost reductionon-line problemsoptimal off-line algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Online algorithms; streaming algorithms (68W27)

Related Items (1)

A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem

This page was built for publication: A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction