Tight Bounds for Double Coverage Against Weak Adversaries

Marek Eliás
Marek Eliás
Grigorios Koumoutsos
Grigorios Koumoutsos

Theory Comput. Syst., Volume 62, Issue 2, 2018, Pages 349-365.

Cited by: 3|Bibtex|Views24|Links
EI
Keywords:
k-serverWeak adversariesResource augmentationDouble coverage

Abstract:

We study the Double Coverage (DC) algorithm for the -server problem in tree metrics in the (, )-setting, i.e., when DC with servers is compared against an offline optimum algorithm with ≤ servers. It is well-known that in such metric spaces DC is -competitive (and thus optimal) for = . We prove that even if > the competitive ratio o...More

Code:

Data:

Your rating :
0

 

Tags
Comments