On the competitive ratio of the work function algorithm for the k-server problem

Yair Bartal, Elias Koutsoupias

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

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 languageAmerican English
Title of host publicationSTACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings
EditorsHorst Reichel, Sophie Tison
PublisherSpringer Verlag
Pages605-613
Number of pages9
ISBN (Print)9783540671411
DOIs
StatePublished - 2000
Externally publishedYes
Event17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 - Lille, France
Duration: 17 Feb 200019 Feb 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1770
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000
Country/TerritoryFrance
CityLille
Period17/02/0019/02/00

Bibliographical note

Funding Information:
∗Corresponding author. E-mail addresses: yair@cs.huji.ac.il (Y. Bartal), elias@di.uoa.gr (E. Koutsoupias). 1Supported in part by a grant of the Israeli Science Foundation (195/02). 2Supported in part by NSF Grant CCR-0105752.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Fingerprint

Dive into the research topics of 'On the competitive ratio of the work function algorithm for the k-server problem'. Together they form a unique fingerprint.

Cite this