On the additive constant of the k-server Work Function Algorithm

We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. As a consequence of [3] this also shows that the Work Function algorithm is strictly (4k − 2)competitive.

• Type: Journal
• Year: 2010
• Where: IPL
• Authors: Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
• Keywords: Competitive, IPL 2010, K-server Problem, Work Function Algorithm