On the Additive Constant of the k-server Work Function Algorithm
Data Structures and Algorithms
2009-02-10 v1
Abstract
We consider the Work Function Algorithm for the k-server problem. We show that if the Work Function Algorithm is c-competitive, then it is also strictly (2c)-competitive. As a consequence of [Koutsoupias and Papadimitriou, JACM 1995] this also shows that the Work Function Algorithm is strictly (4k-2)-competitive.
Cite
@article{arxiv.0902.1378,
title = {On the Additive Constant of the k-server Work Function Algorithm},
author = {Yuval Emek and Pierre Fraigniaud and Amos Korman and Adi Rosen},
journal= {arXiv preprint arXiv:0902.1378},
year = {2009}
}
Comments
7 pages