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

DOI10.1007/S10100-014-0349-4MaRDI QIDQ301952zbMATHOpenAlexFDO

Authors Tomislav Rudec, Robert Manger

Publication date 4 July 2016

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10100-014-0349-4

zbMATH Keywords

combinatorial optimizationnetwork flowsimplementation\(k\)-server problemcost reductionon-line computationwork function algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• A fast work function algorithm for solving the \(k\)-server problem
• A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction
• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem
• A fast implementation of the optimal off-line algorithm for solving the \(k\)-server problem
• A new upper bound on the work function algorithm for the \(k\)-server problem

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A fast work function algorithm for solving the \(k\)-server problem
• A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction
• Competitive algorithms for server problems
• Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
• New Ressults on Server Problems
• On the \(k\)-server conjecture
• On the additive constant of the \(k\)-server work function algorithm
• On the bicriteria \(k\)-server problem
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• Online computation with advice
• The \(k\)-server problem

Cited in

(10)

• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• A new upper bound on the work function algorithm for the \(k\)-server problem
• Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR
• Editorial
• The work function algorithm for the paging problem
• A fast 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 new approach to solve the \(k\)-server problem based on network flows and flow cost reduction
• Managing multiple mobile resources

This page was built for publication: A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem

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