Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mokut, Joshua"'
We consider online algorithms for the $k$-server problem on trees. Chrobak and Larmore proposed a $k$-competitive algorithm for this problem that has the optimal competitive ratio. However, a naive implementation of their algorithm has $O(n)$ time co
Externí odkaz:
http://arxiv.org/abs/2008.00270
