Computer Science – Data Structures and Algorithms
Scientific paper
2009-02-09
Computer Science
Data Structures and Algorithms
7 pages
Scientific paper
We consider the Work Function Algorithm for the k-server problem. 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, JACM
1995] this also shows that the Work Function Algorithm is strictly
(4k-2)-competitive.
Emek Yuval
Fraigniaud Pierre
Korman Amos
Rosen Adi
No associations
LandOfFree
On the Additive Constant of the k-server Work Function Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Additive Constant of the k-server Work Function Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Additive Constant of the k-server Work Function Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-176087