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{9eb8c6fe1edf47e09d6ada3e14f848d4,

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

year = "2010",

month = nov,

day = "30",

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

language = "English",

volume = "110",

pages = "1120--1123",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

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

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 - https://www.scopus.com/pages/publications/77958585095

U2 - 10.1016/j.ipl.2010.09.003

DO - 10.1016/j.ipl.2010.09.003

M3 - 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