The online k-server problem with max-distance objective

DOI10.1007/S10878-013-9621-0MaRDI QIDQ2344003zbMATH OpenOpenAlexFDO

Authors Changzheng He, Li Luo, Yinfeng Xu, Hongmei Li

Publication date 11 May 2015

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

Full work available at URL https://doi.org/10.1007/s10878-013-9621-0

zbMATH Keywords

maximum distance\(k\)-serverdeterministic online algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The \(k\)-server problem
• Competitive algorithms for generalized \(k\)-server in uniform metrics
• Competitive \(k\)-server algorithms
• On the competitive ratio of the work function algorithm for the k-server problem
• A polylogarithmic-competitive algorithm for the \(k\)-server problem

Cites work

• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A lower bound for two-server balancing algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• New Ressults on Server Problems
• On the \(k\)-server conjecture
• On the competitive ratio of the work function algorithm for the k-server problem
• Online k-server routing problems
• The 2-evader problem
• The 3-server problem in the plane.
• The \(k\)-server problem

Cited in

(3)

• Online in-time service problem with minimal server assignment
• A primal-dual online algorithm for the k-server problem on weighted HSTs
• An Optimal On-Line Algorithm for K Servers on Trees

This page was built for publication: The online \(k\)-server problem with max-distance objective

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