On the Additive Constant of the k-server Work Function Algorithm

Details On the Additive Constant of the k-server Work Function Algorithm On the Additive Constant of the k-server Work Function Algorithm

2009-02-09

arxiv.org/abs/0902.1378v1

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.

Affiliated with

Also associated with

No associations

Rating

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.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-176087