This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. A...
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Ro...