The generalized two-server problem

DOI10.1145/1147954.1147960MaRDI QIDQ3546319zbMATH OpenOpenAlexFDO

Authors René A. Sitters, L. Stougie

Publication date 21 December 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1147954.1147960

zbMATH Keywords

\(k\)-server problemcompetitive analysismetrical service systemonline algorithmswork function

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 2038743
• A competitive 2-server algorithm
• Geometric two-server algorithms
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• The CNN problem and other k-server variants

Cited in

(15)

• Nested convex bodies are chaseable
• Memoryless algorithms for the generalized k-server problem on uniform metrics
• A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
• On the continuous CNN problem
• scientific article; zbMATH DE number 4215366 (Why is no real title available?)
• Sequencing Problems in Two-Server Systems
• A New Approach to the Server Problem
• On fast algorithms for two servers
• scientific article; zbMATH DE number 2038743 (Why is no real title available?)
• scientific article; zbMATH DE number 1500545 (Why is no real title available?)
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• Algorithms and Computation
• Competitive Algorithms for Generalized k -Server in Uniform Metrics
• Geometric two-server algorithms
• Online chasing problems for regular polygons

This page was built for publication: The generalized two-server problem

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