The ( h,k )-Server Problem on Bounded Depth Trees

DOI10.1145/3301314zbMath1454.68189OpenAlexW3160943031MaRDI QIDQ4972671

Łukasz Jeż, Marek Eliéš, Grigorios Koumoutsos, Nikhil Bansal

Publication date: 25 November 2019

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

Full work available at URL: https://ir.cwi.nl/pub/29304

zbMATH Keywords

competitive analysisonline algorithms\(k\)-server problemresource augmentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Reallocating multiple facilities on the line

This page was built for publication: The ( h,k )-Server Problem on Bounded Depth Trees