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.
CITATION STYLE
Bartal, Y., & Koutsoupias, E. (2000). On the competitive ratio of the work function algorithm for the k-server problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1770, pp. 605–613). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_50
Mendeley helps you to discover research relevant for your work.