Geometric two-server algorithms

DOI10.1016/0020-0190(94)00223-LMaRDI QIDQ673915zbMATH OpenOpenAlexWikidataFDO

Authors 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

Analysis of algorithmsOn-line algorithms

Mathematics Subject Classification ID

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

Recommendations

• A competitive 2-server algorithm
• The generalized two-server problem
• scientific article; zbMATH DE number 4215366
• scientific article; zbMATH DE number 2038743

Cites work

• A New Approach to the Server Problem
• A competitive 2-server algorithm
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• New Ressults on Server Problems
• On fast algorithms for two servers
• Random walks on weighted graphs and applications to on-line algorithms

Cited in

(5)

• A New Approach to the Server Problem
• On fast algorithms for two servers
• Online search for a hyperplane in high-dimensional Euclidean space
• The generalized two-server problem
• A randomized algorithm for two servers in cross polytope spaces

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

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