most citedSums and products along sparse graphs

1 citations

researchers with a paper here
collaborating institutions
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2009

On the Additive Constant of the k-server Work Function Algorithm

Yuval Emek, Pierre Fraigniaud, Amos Korman +1

We consider the Work Function Algorithm for the k-server problem. We show that if the Work Function Algorithm is c-competitive, then it is also strictly (2c)-competitive. As a cons…