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

Yair Bartal; Elias Koutsoupias

doi:10.1007/3-540-46541-3_50

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 proceeding › Conference contribution › peer-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 language	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	https://doi.org/10.1007/3-540-46541-3_50
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.

Access to Document

10.1007/3-540-46541-3_50

Cite this

Bartal, Y., & Koutsoupias, E. (2000). On the competitive ratio of the work function algorithm for the k-server problem. In H. Reichel, & S. Tison (Eds.), STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings (pp. 605-613). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1770). Springer Verlag. https://doi.org/10.1007/3-540-46541-3_50

Bartal, Yair ; Koutsoupias, Elias. / On the competitive ratio of the work function algorithm for the k-server problem. STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. editor / Horst Reichel ; Sophie Tison. Springer Verlag, 2000. pp. 605-613 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fbb4fefa8d5b45aeabf222d996898bc8,

title = "On the competitive ratio of the work function algorithm for the k-server problem",

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.",

author = "Yair Bartal and Elias Koutsoupias",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 ; Conference date: 17-02-2000 Through 19-02-2000",

year = "2000",

doi = "10.1007/3-540-46541-3\_50",

language = "אנגלית",

isbn = "9783540671411",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "605--613",

editor = "Horst Reichel and Sophie Tison",

booktitle = "STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings",

address = "גרמניה",

}

Bartal, Y & Koutsoupias, E 2000, On the competitive ratio of the work function algorithm for the k-server problem. in H Reichel & S Tison (eds), STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1770, Springer Verlag, pp. 605-613, 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Lille, France, 17/02/00. https://doi.org/10.1007/3-540-46541-3_50

On the competitive ratio of the work function algorithm for the k-server problem. / Bartal, Yair; Koutsoupias, Elias.
STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. ed. / Horst Reichel; Sophie Tison. Springer Verlag, 2000. p. 605-613 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1770).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Bartal, Yair

AU - Koutsoupias, Elias

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84944035364

U2 - 10.1007/3-540-46541-3_50

DO - 10.1007/3-540-46541-3_50

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84944035364

SN - 9783540671411

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

SP - 605

EP - 613

BT - STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings

A2 - Reichel, Horst

A2 - Tison, Sophie

PB - Springer Verlag

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

Y2 - 17 February 2000 through 19 February 2000

ER -

Bartal Y, Koutsoupias E. On the competitive ratio of the work function algorithm for the k-server problem. In Reichel H, Tison S, editors, STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Springer Verlag. 2000. p. 605-613. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46541-3_50

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this