A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle

DOI10.1007/BF01189994zbMath0806.68052OpenAlexW2033732243MaRDI QIDQ1329148

Yuval Rabani, Y. Ravid, Amos Fiat, Baruch Schieber

Publication date: 21 July 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189994

zbMATH Keywords

on-line algorithmoff-line algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (2)

Competitive \(k\)-server algorithms ⋮ A fast work function algorithm for solving the \(k\)-server problem

Cites Work

• Unnamed Item
• A competitive 2-server algorithm
• Competitive \(k\)-server algorithms
• Random walks on weighted graphs and applications to on-line algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• An optimal on-line algorithm for metrical task system

This page was built for publication: A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle