The 3-server problem in the plane.

DOI10.1016/S0304-3975(01)00305-XzbMath1061.68180OpenAlexW2053265764MaRDI QIDQ1853532

Marek Chrobak, Wolfgang W. Bein, Lawrence L. Larmore

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00305-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items

On the competitive ratio of the work function algorithm for the \(k\)-server problem ⋮ A fast work function algorithm for solving the \(k\)-server problem ⋮ R-LINE: a better randomized 2-server algorithm on the line ⋮ Breaking the 2-competitiveness barrier for two servers in a tree ⋮ The \(k\)-server problem ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ Online chasing problems for regular polygons ⋮ Online facility assignment ⋮ Manhattan orbifolds ⋮ The online \(k\)-server problem with max-distance objective ⋮ On Advice Complexity of the k-server Problem under Sparse Metrics ⋮ Asymptotically optimal online page migration on three points

Cites Work

• Unnamed Item
• Unnamed Item
• The 2-evader 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
• Page Migration Algorithms Using Work Functions
• On the k -server conjecture
• Traversing Layered Graphs Using the Work Function Algorithm