Memoryless Algorithms for the Generalized $k$-server Problem on Uniform Metrics
Data Structures and Algorithms
2020-07-20 v1
Abstract
We consider the generalized -server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of on their competitive ratio. In particular we show that the \textit{Harmonic Algorithm} achieves this competitive ratio and provide matching lower bounds. This improves the doubly-exponential bound of Chiplunkar and Vishwanathan for the more general setting of uniform metrics with different weights.
Keywords
Cite
@article{arxiv.2007.08669,
title = {Memoryless Algorithms for the Generalized $k$-server Problem on Uniform Metrics},
author = {Dimitris Christou and Dimitris Fotakis and Grigorios Koumoutsos},
journal= {arXiv preprint arXiv:2007.08669},
year = {2020}
}