Lower bounds for randomized k-server and motion-planning algorithms

Howard Karloff*, Yuval Rabani, Yifrach Ravid

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

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.

Original languageAmerican English
Pages (from-to)293-312
Number of pages20
JournalSIAM Journal on Computing
Volume23
Issue number2
DOIs
StatePublished - 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Lower bounds for randomized k-server and motion-planning algorithms'. Together they form a unique fingerprint.

Cite this