Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth 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
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Journal of the ACM (JACM)
On-line algorithms and the K-server conjecture
On-line algorithms and the K-server conjecture
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)
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The k-server problem is one of the most fundamental on-line problems. The problem is to schedule k mobile servers to serve a sequence of service points in a metric space to mimize the total mileage. The k-server conjecture [11] that states that there exists an optimal k- competitive on-line algorithm has been open for over 10 years. The top candidate on-line algorithm for settling this conjecture is the Work Function Algorithm (WFA) which was recently shown [7,9] to have competitive ratio at most 2k-1. In this paper we lend support to the conjecture that wfa is in fact k-competitive by proving that it achieves this ratio in several special metric spaces.