Geometric two-server algorithms

DOI10.1016/0020-0190(94)00223-LzbMath0875.68530OpenAlexW2087364848WikidataQ126464705 ScholiaQ126464705MaRDI QIDQ673915

Ran El-Yaniv, Jon M. Kleinberg

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00223-l

zbMATH Keywords

On-line algorithmsAnalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cites Work

• A competitive 2-server algorithm
• 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
• A New Approach to the Server Problem
• On fast algorithms for two servers

This page was built for publication: Geometric two-server algorithms