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

In this paper, the authors prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the $k$-server problem, suggested by Manasse, McGeoch, and Sleator [Competitive lgorithms for on-line problems, J. Algorithms, 11 (1990), pp. 208-230], and an on-line motion-plan...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1994-04, Vol.23 (2), p.293-312
Hauptverfasser:	KARLOFF, H, RABANI, Y, RAVID, Y
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Automata. Logic controller Buffer inventories Competition Computer science control theory systems Control theory. Systems Exact sciences and technology Servers Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!