arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5674cs.CG
收藏

多重覆盖的常数因子逼近

A Constant-Factor Approximation for Multi-Covering with Disks

Santanu Bhowmick, Kasturi Varadarajan, Shi-Ke Xue

摘要:

我们考虑以下多覆盖问题的变种与磁盘。我们给出平面中的两个点集$Y$(服务器)和$X$(客户端)、覆盖函数$κ:X \rightarrow \mathcal{N}$和常数$α\geq 1$。在每个服务器的中心是一个单一的磁盘,其半径我们可以自由设置。要求每个客户端$x \in X$至少由服务器磁盘中的$κ(x)$覆盖。我们希望最小化的目标函数是圆盘半径的$α$次幂之和。我们提出了一个多项式时间的算法,这个问题实现了$O(1)$近似。

英文摘要:

We consider variants of the following multi-covering problem with disks. We are given two point sets $Y$ (servers) and $X$ (clients) in the plane, a coverage function $κ:X \rightarrow \mathcal{N}$, and a constant $α\geq 1$. Centered at each server is a single disk whose radius we are free to set. The requirement is that each client $x \in X$ be covered by at least $κ(x)$ of the server disks. The objective function we wish to minimize is the sum of the $α$-th powers of the disk radii. We present a polynomial time algorithm for this problem achieving an $O(1)$ approximation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑