Tight Bounds for Double Coverage Against Weak Adversaries
Theory Comput. Syst., Volume 62, Issue 2, 2018, Pages 349-365.
k-serverWeak adversariesResource augmentationDouble coverage
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
Full Text (Upload PDF)
PPT (Upload PPT)