No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Competitive algorithms for server problems
Journal of Algorithms
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
New results on server problems
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
On fast algorithms for two servers
Journal of Algorithms
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Competitive algorithms for the weighted server problem
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Journal of the ACM (JACM)
Information Processing Letters
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Metrical Task Systems, the Server Problem and the Work Function Algorithm
Developments from a June 1996 seminar on Online algorithms: the state of the art
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A decomposition theorem and bounds for randomized server problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
More on Weighted Servers or FIFO is Better than LRU
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We consider a generalized 2-server problem in which servers have different costs. We prove that, in uniform spaces, a version of the Work Function Algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound. For arbitrary metric spaces, we prove that no memoryless randomized algorithm has a constant competitive ratio. We study a subproblem in which a request specifies two points to be covered by the servers, and the algorithm decides which server to move to which point; we give a 9-competitive deterministic algorithm for any metric space (no better ratio is possible).