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

Yuval Emek; Pierre Fraigniaud; Amos Korman; Adi Rosén

doi:10.1016/j.ipl.2010.09.003

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

Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1120-1123
Number of pages	4
Journal	Information Processing Letters
Volume	110
Issue number	24
DOIs	https://doi.org/10.1016/j.ipl.2010.09.003
State	Published - 30 Nov 2010
Externally published	Yes

Keywords

On-line algorithms
k-server problem

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2010.09.003

Cite this

@article{a52b09d8d51245dda51b8079a6189049,

title = "On the additive constant of the k-server Work Function Algorithm",

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.",

keywords = "On-line algorithms, k-server problem",

author = "Yuval Emek and Pierre Fraigniaud and Amos Korman and Adi Ros{\'e}n",

note = "Funding Information: ✩ A preliminary version of this paper appeared in the Proceedings of WAOA 2009, pp. 128–134. * Corresponding author. E-mail addresses: [email protected] (Y. Emek), [email protected] (P. Fraigniaud), [email protected] (A. Korman), [email protected] (A. Ros{\'e}n). 1 This work was partially done during this author{\textquoteright}s visit at LIAFA, CNRS and University Paris Diderot, supported by Action COST 295 DYNAMO. Also partially supported by the Israel Science Foundation, grants 664/05 and 221/07. 2 Additional support from the ANR project ALADDIN, by the INRIA project GANG, and by COST Action 295 DYNAMO. 3 Research partially supported by ANR projects AlgoQP, QRAC, and ALADDIN.",

year = "2010",

month = nov,

day = "30",

doi = "10.1016/j.ipl.2010.09.003",

language = "אנגלית",

volume = "110",

pages = "1120--1123",

number = "24",

}

TY - JOUR

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

AU - Emek, Yuval

AU - Fraigniaud, Pierre

AU - Korman, Amos

AU - Rosén, Adi

N1 - Funding Information: ✩ A preliminary version of this paper appeared in the Proceedings of WAOA 2009, pp. 128–134. * Corresponding author. E-mail addresses: [email protected] (Y. Emek), [email protected] (P. Fraigniaud), [email protected] (A. Korman), [email protected] (A. Rosén). 1 This work was partially done during this author’s visit at LIAFA, CNRS and University Paris Diderot, supported by Action COST 295 DYNAMO. Also partially supported by the Israel Science Foundation, grants 664/05 and 221/07. 2 Additional support from the ANR project ALADDIN, by the INRIA project GANG, and by COST Action 295 DYNAMO. 3 Research partially supported by ANR projects AlgoQP, QRAC, and ALADDIN.

PY - 2010/11/30

Y1 - 2010/11/30

N2 - 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.

AB - 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.

KW - On-line algorithms

KW - k-server problem

UR - http://www.scopus.com/inward/record.url?scp=77958585095&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2010.09.003

DO - 10.1016/j.ipl.2010.09.003

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77958585095

SN - 0020-0190

VL - 110

SP - 1120

EP - 1123

JO - Information Processing Letters

JF - Information Processing Letters

IS - 24

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this