Randomized k-server algorithms for growth-rate bounded graphs

Details Randomized k-server algorithms for growth-rate bounded graphs Randomized k-server algorithms for growth-rate bounded graphs

2004-06-17

arxiv.org/abs/cs/0406033v2

J. Algorithms, 55(2): 192-202, 2005

Computer Science

Data Structures and Algorithms

The paper is withdrawn

Scientific paper

10.1016/j.jalgor.2004.06.002

The paper referred to in the title is withdrawn.

Affiliated with

Also associated with

No associations

Rating

Randomized k-server algorithms for growth-rate bounded graphs 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 Randomized k-server algorithms for growth-rate bounded graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized k-server algorithms for growth-rate bounded graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178075