The online \(k\)-server problem with max-distance objective
From MaRDI portal
Publication:2344003
DOI10.1007/s10878-013-9621-0zbMath1320.90072OpenAlexW2037550335MaRDI QIDQ2344003
Changzheng He, Li Luo, Yin-Feng Xu, Hong-Mei 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
Related Items (2)
A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs ⋮ Online in-time service problem with minimal server assignment
Cites Work
- Unnamed Item
- Unnamed Item
- The \(k\)-server problem
- Online \(k\)-server routing problems
- A lower bound for two-server balancing algorithms
- The 2-evader problem
- The 3-server problem in the plane.
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- On the k-server conjecture
- An Optimal On-Line Algorithm for K Servers on Trees
- New Ressults on Server Problems
- Competitive algorithms for server problems
This page was built for publication: The online \(k\)-server problem with max-distance objective