An Algorithm for Online Facility Leasing

Abstract

We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length l _k . Opening a facility i using lease type k causes a cost of $f_i^k$ and ensures that i is open for the next l _k time steps. In addition to costs for opening facilities, we have to take connection costs c _ij into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.

This variant of the online facility location problem was introduced by [7] and is strongly related to both the online facility problem by [5] and the parking permit problem by [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O (Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is $O (\ensuremath{l_{\text{max}}} \log(\ensuremath{l_{\text{max}}} ))$-competitive. Here $\ensuremath{l_{\text{max}}}$ denotes the maximum lease length. Moreover, we prove that it is $O (\log^2(\ensuremath{l_{\text{max}}} ))$-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in $l_{\text{max}}$.

This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901) and by the Graduate School on Applied Network Science (GSANS).