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

Authors:
Yuval Emek;Pierre Fraigniaud;Amos Korman;Adi Rosén
Affiliations:
Microsoft Israel R&D Center, Herzelia, Israel and School of Electrical Engineering, 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:
Information Processing Letters
Year:
2010

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

A new approach to solve the k-server problem based on network flows and flow cost reduction

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the Work Function Algorithm for the k-server problem (Chrobak and Larmore, 1991; Koutsoupias and Papadimitriou, 1995) [2,4]. 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, 1995) [4] this also shows that the Work Function Algorithm is strictly (4k-2)-competitive.