几何最大覆盖问题的线性时间逼近格式
Linear Time Approximation Schemes for Geometric Maximum Coverage
摘要:
我们研究近似算法的几何版本的最大覆盖问题:让$\mathcal{P}$是一组$n$加权点在平面上。让$D$表示一个平面对象,如矩形或圆盘。我们希望放置$D$的$m$副本,以使这些副本所覆盖的$\mathcal{P}$中的点的权重之和最大化。对于任何固定的$\varepsilon>0$,我们提出了有效的近似方案,可以找到一个$(1-\varepsilon)$ -近似的最优解。特别是,对于$m=1$和$D$是一个矩形的特殊情况下,我们的算法运行在时间$O(n\log (\frac{1}{\varepsilon}))$,改善了以前的结果。对于$m>1$和矩形的情况下,我们的算法运行在$O(\frac{n}{\varepsilon}\log (\frac{1}{\varepsilon})+\frac{m}{\varepsilon}\log m +m(\frac{1}{\varepsilon})^{O(\min(\sqrt{m},\frac{1}{\varepsilon}))})$时间。对于更一般的一类形状(包括磁盘,多边形与$O(1)$边缘),我们的算法运行在$O(n(\frac{1}{\varepsilon})^{O(1)}+\frac{m}ε\log m + m(\frac{1}{\varepsilon})^{O(\min(m,\frac{1}{\varepsilon^2}))})$的时间。
英文摘要:
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let $\mathcal{P}$ be a set of $n$ weighted points in the plane. Let $D$ represent a planar object, such as a rectangle, or a disk. We want to place $m$ copies of $D$ such that the sum of the weights of the points in $\mathcal{P}$ covered by these copies is maximized. For any fixed $\varepsilon>0$, we present efficient approximation schemes that can find a $(1-\varepsilon)$-approximation to the optimal solution. In particular, for $m=1$ and for the special case where $D$ is a rectangle, our algorithm runs in time $O(n\log (\frac{1}{\varepsilon}))$, improving on the previous result. For $m>1$ and the rectangular case, our algorithm runs in $O(\frac{n}{\varepsilon}\log (\frac{1}{\varepsilon})+\frac{m}{\varepsilon}\log m +m(\frac{1}{\varepsilon})^{O(\min(\sqrt{m},\frac{1}{\varepsilon}))})$ time. For a more general class of shapes (including disks, polygons with $O(1)$ edges), our algorithm runs in $O(n(\frac{1}{\varepsilon})^{O(1)}+\frac{m}ε\log m + m(\frac{1}{\varepsilon})^{O(\min(m,\frac{1}{\varepsilon^2}))})$ time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。