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  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.
|Original language||American English|
|Title of host publication||STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings|
|Editors||Horst Reichel, Sophie Tison|
|Number of pages||9|
|State||Published - 2000|
|Event||17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 - Lille, France|
Duration: 17 Feb 2000 → 19 Feb 2000
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000|
|Period||17/02/00 → 19/02/00|
Bibliographical noteFunding Information:
∗Corresponding author. E-mail addresses: firstname.lastname@example.org (Y. Bartal), email@example.com (E. Koutsoupias). 1Supported in part by a grant of the Israeli Science Foundation (195/02). 2Supported in part by NSF Grant CCR-0105752.
© Springer-Verlag Berlin Heidelberg 2000.