单位圆盘图和圆图上的最小选择子集
Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
AI总结:
本文研究了单位圆盘图和圆图上的最小选择子集问题,证明了其在一般图上的log-APX难性,并给出了单位圆盘图上的PTAS及NP难性证明。
摘要:
在连接的简单图G = (V(G),E(G))中,每个顶点被分配一种颜色,其中V(G)可以表示为c个子集V₁,...,Vₙ的并集,Vᵢ表示颜色为i的顶点集合。一个子集S被称为选择子集,如果对于每个i,每个顶点v在Vᵢ中至少有一个最近邻在S ∪ (V(G) \ Vᵢ)中,并且该最近邻也在Vᵢ中。最小选择子集(MSS)问题要求找到一个最小大小的选择子集。我们证明,在一般图上,MSS问题在c=2时也是log-APX难的,因此除非P=NP,否则该问题不接受多项式时间近似方案(PTAS)。另一方面,我们为单位圆盘图提供了一个PTAS,该方案不需要几何表示,并适用于任意c。此外,我们证明MSS问题在单位圆盘图上对于任意c仍然是NP难的。此外,我们还证明在圆图上,MSS问题在c=2时也是log-APX难的。
英文摘要:
In a connected simple graph G = (V(G),E(G)), each vertex is assigned one of c colors, where V(G) can be written as a union of a total of c subsets V_{1},...,V_{c} and V_{i} denotes the set of vertices of color i. A subset S of V(G) is called a selective subset if, for every i, every vertex v in V_{i} has at least one nearest neighbor in $S \cup (V(G) \setminus V_{i})$ that also lies in V_{i}. The Minimum Selective Subset (MSS) problem asks for a selective subset of minimum size. We show that the MSS problem is log-APX-hard on general graphs, even when c=2. As a consequence, the problem does not admit a polynomial-time approximation scheme (PTAS) unless P = NP. On the positive side, we present a PTAS for unit disk graphs, which works without requiring a geometric representation and applies for arbitrary c. We further prove that MSS remains NP-complete in unit disk graphs for arbitrary c. In addition, we show that the MSS problem is log-APX-hard on circle graphs, even when c=2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。