Memoryless Algorithms for the Generalized $k$-server Problem on Uniform Metrics

Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos

We consider the generalized $k$-server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of $\Theta (k!)$ on their competitive ratio. In parti…