k)-Server Problem on Bounded Depth Trees

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos. k)-Server Problem on Bounded Depth Trees. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1022-1037, SIAM, 2017. [doi]

Abstract

Abstract is missing.