TY - JOUR
T1 - Lower bounds for randomized k-server and motion-planning algorithms
AU - Karloff, Howard
AU - Rabani, Yuval
AU - Ravid, Yifrach
PY - 1994
Y1 - 1994
N2 - The authors prove, against an oblivious adversary, 1. an Ω(log k) lower bound on the competitive ration of any randomized on-line k-server algorithm in any sufficiently large metric space. 2. an Ω(log log k) lower bound on the competitive ration of any randomized on-line k-server algorithm in any metric space with at least k+1 points, and 3. an Ω(log log n) lower bound on the competitive ratio of any on-line motion-planning algorithm for a scene with n obstacles.
AB - The authors prove, against an oblivious adversary, 1. an Ω(log k) lower bound on the competitive ration of any randomized on-line k-server algorithm in any sufficiently large metric space. 2. an Ω(log log k) lower bound on the competitive ration of any randomized on-line k-server algorithm in any metric space with at least k+1 points, and 3. an Ω(log log n) lower bound on the competitive ratio of any on-line motion-planning algorithm for a scene with n obstacles.
UR - https://www.scopus.com/pages/publications/0028405585
U2 - 10.1137/S0097539792224838
DO - 10.1137/S0097539792224838
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028405585
SN - 0097-5397
VL - 23
SP - 293
EP - 312
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 2
ER -