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,

• Type: Conference
• Year: 1991
• Where: STOC
• Authors: Howard J. Karloff, Yuval Rabani, Yiftach Ravid
• Keywords: Algorithms, Lower Bounds, Oblivious Adversary, On-line Motion-planning Problem, STOC 1991