We consider online algorithms for the k-servers problem on trees. There is an k-competitive algorithm for this problem, and it is the best competitive ratio. M. Chrobak and L. Larmore suggested it. At the same time, the existing implementation has O(n) time complexity, where n is a number of nodes in a tree. We suggest a new time-efficient implementation of the algorithm. It has O(n) time complexity for preprocessing and O\left(k(\log n)^2\right) for processing a query.
We consider online algorithms for the k-server problem on trees. There is a k-competitive algorithm for this problem, and it is the best competitive ratio. M. Chrobak and L. Larmore provided it. At the same time, the existing implementation has O(n) time complexity, where n is a number of nodes in a tree. We provide a new time-efficient implementation of the algorithm. It has O(n) time complexity for preprocessing and O\left(k(\log n)^2\right) for processing a query.
R
k-servers
k-server
R
an
a
R
suggested
provided
R
suggest
provide