## Abstract

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.

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 |

Publisher | Springer Verlag |

Pages | 605-613 |

Number of pages | 9 |

ISBN (Print) | 9783540671411 |

DOIs | |

State | Published - 2000 |

Externally published | Yes |

Event | 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 - Lille, France Duration: 17 Feb 2000 → 19 Feb 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1770 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 |
---|---|

Country/Territory | France |

City | Lille |

Period | 17/02/00 → 19/02/00 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.