TY - GEN
T1 - On the additive constant of the κ-server work function algorithm
AU - Emek, Yuval
AU - Fraigniaud, Pierre
AU - Korman, Amos
AU - Rosén, Adi
PY - 2009
Y1 - 2009
N2 - We consider the Work Function Algorithm for the κ-server problem [2,4]. We show that if the Work Function Algorithm is ccompetitive, then it is also strictly (2c)-competitive. As a consequence of [4] this also shows that the Work Function Algorithm is strictly (4κ-2)- competitive.
AB - We consider the Work Function Algorithm for the κ-server problem [2,4]. We show that if the Work Function Algorithm is ccompetitive, then it is also strictly (2c)-competitive. As a consequence of [4] this also shows that the Work Function Algorithm is strictly (4κ-2)- competitive.
UR - http://www.scopus.com/inward/record.url?scp=78651247807&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-12450-1_12
DO - 10.1007/978-3-642-12450-1_12
M3 - Conference contribution
AN - SCOPUS:78651247807
SN - 3642124496
SN - 9783642124495
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 128
EP - 134
BT - Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers
T2 - 7th Workshop on Approximation and Online Algorithms, WAOA 2009
Y2 - 10 September 2009 through 11 September 2009
ER -