The online k-server problem with max-distance objective

DOI10.1007/S10878-013-9621-0zbMATH Open1320.90072OpenAlexW2037550335MaRDI QIDQ2344003FDOQ2344003

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

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

zbMATH Keywords

maximum distance\(k\)-serverdeterministic online algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• The 2-evader problem
• On the \(k\)-server conjecture
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• The 3-server problem in the plane.
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• New Ressults on Server Problems
• The \(k\)-server problem
• Title not available (Why is that?)
• Online \(k\)-server routing problems
• A lower bound for two-server balancing algorithms

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)