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

Nikhil Bansal, Marek Eliáš, Łukasz Jeż +1

We study the $k$-server problem in the resource augmentation setting i.e., when the performance of the online algorithm with $k$ servers is compared to the offline optimal solution…