A Hitting Set Relaxation for k-Server and an Extension to Time-Windows

11/17/2021
by   Anupam Gupta, et al.
0

We study the k-server problem with time-windows. In this problem, each request i arrives at some point v_i of an n-point metric space at time b_i and comes with a deadline e_i. One of the k servers must be moved to v_i at some time in the interval [b_i, e_i] to satisfy this request. We give an online algorithm for this problem with a competitive ratio of polylog (n,Δ), where Δ is the aspect ratio of the metric space. Prior to our work, the best competitive ratio known for this problem was O(k · polylog(n)) given by Azar et al. (STOC 2017). Our algorithm is based on a new covering linear program relaxation for k-server on HSTs. This LP naturally corresponds to the min-cost flow formulation of k-server, and easily extends to the case of time-windows. We give an online algorithm for obtaining a feasible fractional solution for this LP, and a primal dual analysis framework for accounting the cost of the solution. Together, they yield a new k-server algorithm with poly-logarithmic competitive ratio, and extend to the time-windows case as well. Our principal technical contribution lies in thinking of the covering LP as yielding a truncated covering LP at each internal node of the tree, which allows us to keep account of server movements across subtrees. We hope that this LP relaxation and the algorithm/analysis will be a useful tool for addressing k-server and related problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2018

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

The generalized k-server problem is an extension of the weighted k-serve...
research
06/17/2020

Caching with Time Windows and Delays

We consider two generalizations of the classical weighted paging problem...
research
03/20/2018

Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line

In the online metric bipartite matching problem, we are given a set S of...
research
08/11/2023

Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line

In the online facility assignment on a line OFAL(S,c) with a set S of k ...
research
07/14/2020

A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location

In the online non-metric variant of the facility location problem, there...
research
09/19/2023

Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs

Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewa...
research
05/17/2022

Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials

The deterministic k-server conjecture states that there is a k-competiti...

Please sign up or login with your details

Forgot password? Click here to reset