Sciweavers

60
Voted
STACS
2000
Springer
15 years 11 days ago
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...
Yair Bartal, Elias Koutsoupias