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

Nikhil Bansal et al. (2017)
a service of Schloss Dagstuhl - Leibniz Center for Informatics