Bicriteria Approximation Algorithms for Priority Matroid Median

Fairness considerations have motivated new clustering problems and algorithms in recent years. In this paper we consider the Priority Matroid Median problem which generalizes the Priority $k$-Median problem that has recently been studied. The input consists of a set of facilities $\mathcal{F}$ and a set of clients $\mathcal{C}$ that lie in a metric space $(\mathcal{F} \cup \mathcal{C},d)$, and a matroid $\mathcal{M}=(\mathcal{F},\mathcal{I})$ over the facilities. In addition each client $j$ has a specified radius $rj \ge 0$ and each facility $i \in \mathcal{F}$ has an opening cost $fi$. The goal is to choose a subset $S \subseteq \mathcal{F}$ of facilities to minimize the $\sum{i \in \mathcal{F}} fi + \sum{j \in \mathcal{C}} d(j,S)$ subject to two constraints: (i) $S$ is an independent set in $\mathcal{M}$ (that is $S \in \mathcal{I}$) and (ii) for each client $j$, its distance to an open facility is at most $rj$ (that is, $d(j,S) \le rj$). For this problem we describe the first bicriteria $(c1,c2)$ approximations for fixed constants $c1,c2$: the radius constraints of the clients are violated by at most a factor of $c1$ and the objective cost is at most $c2$ times the optimum cost. We also improve the previously known bicriteria approximation for the uniform radius setting ($rj := L$ $\forall j \in \mathcal{C}$).