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

DOI10.1137/1.9781611974782.65zbMath1410.68404arXiv1608.08527OpenAlexW2988156420MaRDI QIDQ4575805

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

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

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)

Online facility location with mobile facilities

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