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

利用单位矩进行点集隔离是NP完全的

Point Set Isolation Using Unit Disks is NP-complete

Rainer Penninger, Ivo Vigan

摘要:

我们考虑的情况下,一个给定的一组S的点在平面和收集D的单位磁盘嵌入在平面上。我们发现,找到一个最小的基数子集的D,使任何两点之间的任何路径在S是由至少一个磁盘是NP-完全的。这解决了Matt Gibson等人提出的一个开放问题[1]。使用类似的约简,我们证明了找到D的最小基数子集D'使得R^2 -(D-D')由单个连通区域组成也是NP完全的。最后,我们表明,多端切割问题仍然是NP-完全时,仅限于单位圆盘图。

英文摘要:

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is intersected by at least one disk is NP-complete. This settles an open problem raised by Matt Gibson et al[1]. Using a similar reduction, we show that finding a minimum cardinality subset D' of D such that R^2 - (D - D') consists of a single connected region is also NP-complete. Lastly, we show that the Multiterminal Cut Problem remains NP-complete when restricted to unit disk graphs.

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

↑