A competitive 2-server algorithm

DOI10.1016/0020-0190(91)90160-JzbMath0736.68043OpenAlexW2078625629MaRDI QIDQ1182124

Sandy Irani, Ronitt Rubinfeld

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90160-j

zbMATH Keywords

on-line algorithmamortized analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (12)

Competitive randomized algorithms for nonuniform problems ⋮ A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle ⋮ Competitive \(k\)-server algorithms ⋮ A lower bound for two-server balancing algorithms ⋮ Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space ⋮ Randomized algorithms for the on-line minimum matching problem on euclidean space ⋮ The \(k\)-server problem ⋮ Dynamic pricing of servers on trees ⋮ Geometric two-server algorithms ⋮ Two online algorithms for the ambulance systems ⋮ Trackless online algorithms for the server problem ⋮ Limited bookmark randomized online algorithms for the paging problem

Cites Work

• A New Approach to the Server Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A competitive 2-server algorithm