A new upper bound on the work function algorithm for the k-server problem

DOI10.1007/S10878-019-00493-ZMaRDI QIDQ2292157zbMATHOpenAlexWikidataFDO

Authors W. M. Zhang, Yongxi Cheng

Publication date 3 February 2020

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00493-z

zbMATH Keywords

competitive analysison-line algorithms\(k\)-server problemwork function

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1500547
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• scientific article; zbMATH DE number 1528669
• The 3-server problem in the plane.
• On the k -server conjecture

Cites work

• scientific article; zbMATH DE number 15120 (Why is no real title available?)
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• A fast work function algorithm for solving the \(k\)-server problem
• On the k -server conjecture
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• The \(k\)-server problem

Cited in

(13)

• 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
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• scientific article; zbMATH DE number 1528669 (Why is no real title available?)
• On the additive constant of the \(k\)-server work function algorithm
• The work function algorithm for the paging problem
• On the additive constant of the \(k\)-server work function algorithm
• A fast work function algorithm for solving the \(k\)-server problem
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• The online \(k\)-server problem with rejection
• scientific article; zbMATH DE number 1543054 (Why is no real title available?)
• 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 new upper bound on the work function algorithm for the \(k\)-server problem

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