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

Yair Bartal Elias Koutsoupias

Published in: Theor. Comput. Sci. (2004)

Keyphrases

competitive ratio
dynamic programming
optimal solution
average case
learning algorithm
objective function
worst case
theoretical analysis
np hard
probabilistic model
branch and bound algorithm
search procedure
optimal strategy