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

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 ( 2 c ) -competitive. As a consequence of (Koutsoupias and Papadimitriou, 19...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 110; číslo 24; s. 1120 - 1123
Hlavní autori: Emek, Yuval, Fraigniaud, Pierre, Korman, Amos, Rosén, Adi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 30.11.2010
Elsevier
Elsevier Sequoia S.A
Predmet:
Additives
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
k-server problem
Mathematical problems
Miscellaneous
On-line algorithms
Studies
Theoretical computing
Work functions
k-server problem
On-line algorithms
Work function
Computer theory
Information processing
Online algorithm
Competitive algorithms
Algorithm analysis
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 ( 2 c ) -competitive. As a consequence of (Koutsoupias and Papadimitriou, 1995) [4] this also shows that the Work Function Algorithm is strictly ( 4 k − 2 ) -competitive. ► If the Work Function Algorithm for the k-server problem is c-competitive, then it is also strictly ( 2 c ) -competitive.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2010.09.003