Mobile facility location: combinatorial filtering via weighted occupancy

Abstract

An instance of the mobile facility location problem consists of a complete directed graph $G = (V, E)$, in which each arc $(u, v) \in E$ is associated with a numerical attribute $\mathcal M (u,v)$, representing the cost of moving any object from $u$ to $v$. An additional ingredient of the input is a collection of servers $S = \{ s_1, \ldots , s_k \}$ and a set of clients $C = \{ c_1, \ldots , c_\ell \}$, which are located at nodes of the underlying graph. With this setting in mind, a movement scheme is a function $\psi : S \rightarrow V$ that relocates each server $s_i$ to a new position, $\psi ( s_i )$. We refer to $\mathcal M ( s_i, \psi ( s_i ) )$ as the relocation cost of $s_i$, and to $\min _{i \in [k]} \mathcal M (c_j, \psi ( s_i ) )$, the cost of assigning client $c_j$ to the nearest final server location, as the service cost of $c_j$. The objective is to compute a movement scheme that minimizes the sum of relocation and service costs. In this paper, we resolve an open question posed by Demaine et al. (SODA ’07) by characterizing the approximability of mobile facility location through LP-based methods. We also develop a more efficient algorithm, which is based on a combinatorial filtering approach. The latter technique is of independent interest, as it may be applicable in other settings as well. In this context, we introduce a weighted version of the occupancy problem, for which we establish interesting tail bounds, not before demonstrating that existing bounds cannot be extended.