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

The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total mileage. The k-server conjecture of Manasse, McGeogh, and Sleator states that there exists a k-competitive online algori...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 324; no. 2; pp. 337 - 345
Main Authors:	Bartal, Yair, Koutsoupias, Elias
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 20.09.2004 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Online algorithms The k-server problem Theoretical computing Work function Online algorithms Work function The k-server problem Online algorithm Metric space Computer theory k server problem Competitive algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!