The Infinite Server Problem

DOI10.1145/3456632OpenAlexW3186059492MaRDI QIDQ5032029FDOQ5032029

Authors: Christian Coester, Elias Koutsoupias, Philip Lazos 

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.08474

Recommendations

• scientific article; zbMATH DE number 7204466
• The \((h,k)\)-server problem on bounded depth trees
• The (h, k)-Server Problem on Bounded Depth Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems

zbMATH Keywords

online algorithmscompetitive analysisresource augmentation\(k\)-server

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

This page was built for publication: The Infinite Server Problem

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