The (h, k)-Server Problem on Bounded Depth Trees

@inproceedings{Bansal2017TheK,
  title={The (h, k)-Server Problem on Bounded Depth Trees},
  author={N. Bansal and M. Eli{\'a}{\vs} and Lukasz Jez and Grigorios Koumoutsos},
  booktitle={SODA},
  year={2017}
}
  • N. Bansal, M. Eliáš, +1 author Grigorios Koumoutsos
  • Published in SODA 2017
  • Mathematics, Computer Science
  • We study the $k$-server problem in the resource augmentation setting i.e., when the performance of the online algorithm with $k$ servers is compared to the offline optimal solution with $h \leq k$ servers. The problem is very poorly understood beyond uniform metrics. For this special case, the classic $k$-server algorithms are roughly $(1+1/\epsilon)$-competitive when $k=(1+\epsilon) h$, for any $\epsilon >0$. Surprisingly however, no $o(h)$-competitive algorithm is known even for HSTs of depth… CONTINUE READING

    Figures and Topics from this paper.

    The (h,k)-Server Problem on Bounded Depth Trees
    • 5
    • PDF
    The Infinite Server Problem
    • 8
    • PDF
    Online Facility Location with Mobile Facilities
    • 4
    Unbounded lower bound for k-server against weak adversaries
    Reallocating Multiple Facilities on the Line
    • 1
    • PDF
    The online 𝑘-taxi problem
    Online Mincut: Advice, Randomization and More
    M ay 2 01 9 Reallocating Multiple Facilities on the Line ∗
    Algorithms for k-server problems

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    The (h,k)-Server Problem on Bounded Depth Trees
    • 5
    • PDF
    The Infinite Server Problem
    • 8
    • PDF
    On the competitive ratio of the work function algorithm for the k-server problem
    • 52
    • PDF
    New results on server problems
    • 255
    Competitive Algorithms for Server Problems
    • 420
    • PDF
    Tight Bounds for Double Coverage Against Weak Adversaries
    • 7
    • PDF
    Weak adversaries for the k-server problem
    • 37
    • Highly Influential
    An Optimal On-Line Algorithm for k-Servers on Trees
    • 168
    • PDF
    Online computation and competitive analysis
    • 2,361
    • PDF
    On the k-server conjecture
    • 281
    • PDF