A randomized on–line algorithm for the k–server problem on a line

DOI10.1002/rsa.20124zbMath1113.68634OpenAlexW4243470929MaRDI QIDQ5486309

Béla Csaba, Sachin Lodha

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20124

zbMATH Keywords

\(k\)-server algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (4)

A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs ⋮ R-LINE: a better randomized 2-server algorithm on the line ⋮ Breaking the 2-competitiveness barrier for two servers in a tree ⋮ Randomized algorithm for the \(k\)-server problem on decomposable spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Better algorithms for unfair metrical task systems and applications

This page was built for publication: A randomized on–line algorithm for the k–server problem on a line