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

单位面积和单位正方形上的唯一集覆盖

Unique Set Cover on Unit Disks and Unit Squares

Saeed Mehrabi

摘要:

研究了单位圆盘和单位正方形上的唯一集合覆盖问题。对于给定的$n$点的集合$P$和$m$几何对象的集合$D$,唯一集合覆盖问题的目标是选择对象的子集$D'\subseteq D$,使得$P$中的每个点被$D'$中的至少一个对象覆盖,并且唯一覆盖的点的数量被最大化,其中,如果点被$D'$中的恰好一个对象覆盖,则该点被唯一地覆盖。本文证明了单位圆盘和单位正方形上的唯一集合覆盖都是NP-难的,并利用Chan和Hu(Comput. 48(5),2015)。

英文摘要:

We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset $D'\subseteq D$ of objects such that every point in $P$ is covered by at least one object in $D'$ and the number of points covered uniquely is maximized, where a point is covered uniquely if the point is covered by exactly one object in $D'$. In this paper, (i) we show that the Unique Set Cover is NP-hard on both unit disks and unit squares, and (ii) we give a PTAS for this problem on unit squares by applying the mod-one approach of Chan and Hu (Comput. Geom. 48(5), 2015).

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

↑