关于度量多重覆盖问题
On Metric Multi-Covering Problems
摘要:
在度量多覆盖问题中,给定任意度量空间$(X \cup Y, d)$中的两个点集$Y$(服务器)和$X$(客户端),一个正整数$k$代表每个客户端的覆盖需求,以及一个常数$α\geq 1$ .每个服务器可以有一个以其为中心的任意半径的球。每个客户端$x \in X$至少需要被以服务器为中心的$k$这样的球覆盖。我们希望最小化的目标函数是球半径的$α$次幂之和。在这篇文章中,我们考虑MMC问题以及一些非平凡的推广,如(a)非均匀MMC,我们允许客户端特定的需求,和(b)$t$ -MMC,我们要求打开的服务器的数量至多是某个给定的整数$t$。对于这些问题中的每一个,我们提出了一个有效的算法,减少了相应的$1$覆盖问题,其中每个客户端的覆盖需求是$1$的几个实例的问题。我们的减少保持最优的乘法常数因子。应用已知的常数因子近似算法的$1$覆盖,我们得到的第一常数近似MMC和这些推广。
英文摘要:
In the metric multi-cover problem (MMC), we are given two point sets $Y$ (servers) and $X$ (clients) in an arbitrary metric space $(X \cup Y, d)$, a positive integer $k$ that represents the coverage demand of each client, and a constant $α\geq 1$. Each server can have a single ball of arbitrary radius centered on it. Each client $x \in X$ needs to be covered by at least $k$ such balls centered on servers. The objective function that we wish to minimize is the sum of the $α$-th powers of the radii of the balls. In this article, we consider the MMC problem as well as some non-trivial generalizations, such as (a) the non-uniform MMC, where we allow client-specific demands, and (b) the $t$-MMC, where we require the number of open servers to be at most some given integer $t$. For each of these problems, we present an efficient algorithm that reduces the problem to several instances of the corresponding $1$-covering problem, where the coverage demand of each client is $1$. Our reductions preserve optimality up to a multiplicative constant factor. Applying known constant factor approximation algorithms for $1$-covering, we obtain the first constant approximations for the MMC and these generalizations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。