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

DOI10.1016/J.COR.2012.11.006zbMATH Open1349.90172OpenAlexW2023952684MaRDI QIDQ340306FDOQ340306

Authors: 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

Recommendations

• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• A fast implementation of the optimal off-line algorithm for solving the \(k\)-server problem
• A fast work function algorithm for solving the \(k\)-server problem
• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem
• A new upper bound on the work function algorithm for the \(k\)-server problem

zbMATH Keywords

network flowsimplementationexperiments\(k\)-server problemcost reductionwork function algorithmon-line problemsoptimal off-line algorithm

Mathematics Subject Classification ID

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

Cited In (2)

• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• A fast implementation of the optimal off-line 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340306)