Sciweavers

Share
STOC
1991
ACM

Lower Bounds for Randomized k-Server and Motion Planning Algorithms

9 years 5 months ago
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-planning problem due to [PY]. We prove, against an oblivious adversary,
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
Added 27 Aug 2010
Updated 27 Aug 2010
Type Conference
Year 1991
Where STOC
Authors Howard J. Karloff, Yuval Rabani, Yiftach Ravid
Comments (0)
books