Competitive k-server algorithms

Deterministic competitive k-server algorithms are given for all k and all metric spaces. This settles the k-server conjecture of M.S. Manasse et al. (1988) up to the competitive ratio. The best previous result for general metric spaces was a three-server randomized competitive algorithm and a noncon...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 454 - 463 vol.2
Main Authors Fiat, A., Rabani, Y., Ravid, Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Computer science
Costs
Current measurement
Extraterrestrial measurements
Mathematics
Space exploration
Upper bound
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89566

Cover

More Information
Summary:Deterministic competitive k-server algorithms are given for all k and all metric spaces. This settles the k-server conjecture of M.S. Manasse et al. (1988) up to the competitive ratio. The best previous result for general metric spaces was a three-server randomized competitive algorithm and a nonconstructive proof that a deterministic three-server competitive algorithm exists. The competitive ratio the present authors can prove is exponential in the number of servers. Thus, the question of the minimal competitive ratio for arbitrary metric spaces is still open. The methods set forth here also give competitive algorithms for a natural generalization of the k-server problem, called the k-taxicab problem.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89566