A lower bound for two-server balancing algorithms

DOI10.1016/0020-0190(94)90138-4zbMATH Open0942.68782OpenAlexW1986840063MaRDI QIDQ1336749FDOQ1336749

Authors: 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)

Cites Work

• Competitive algorithms for server problems
• A New Approach to the Server Problem
• New Ressults on Server Problems
• A competitive 2-server algorithm
• On fast algorithms for two servers

Cited In (3)

• Any-order online interval selection
• Online facility assignment
• The online \(k\)-server problem with max-distance objective

This page was built for publication: A lower bound for two-server balancing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336749)