On fast algorithms for two servers

DOI10.1016/0196-6774(91)90035-WzbMath0767.68054OpenAlexW2009923036MaRDI QIDQ3988823

Lawrence L. Larmore, Marek Chrobak

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90035-w

zbMATH Keywords

competitiveness\(k\)-server problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (9)

Competitive \(k\)-server algorithms ⋮ A lower bound for two-server balancing algorithms ⋮ The weighted 2-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 ⋮ Geometric two-server algorithms ⋮ Randomized competitive algorithms for the list update problem ⋮ Trackless online algorithms for the server problem

This page was built for publication: On fast algorithms for two servers