A lower bound for two-server balancing algorithms

DOI10.1016/0020-0190(94)90138-4zbMath0942.68782OpenAlexW1986840063MaRDI QIDQ1336749

Jon M. Kleinberg

Publication date: 26 February 1996

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

Full work available at URL: https://hdl.handle.net/1813/6120

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (2)

Online facility assignment ⋮ The online \(k\)-server problem with max-distance objective

Cites Work

• A competitive 2-server algorithm
• 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: A lower bound for two-server balancing algorithms