On the additive constant of the k-server work function algorithm

Authors:
Yuval Emek;Pierre Fraigniaud;Amos Korman;Adi Rosén
Affiliations:
Tel Aviv University, Tel Aviv, Israel;CNRS and University Paris Diderot, France;CNRS and University Paris Diderot, France;CNRS and University of Paris 11, France
Venue:
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Year:
2009

Citing 4
Cited 1

Competitive algorithms for server problems

Journal of Algorithms
On the k-server conjecture

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
Online Computation with Advice

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I

Online computation with advice

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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