UDG中边-顶点支配问题的复杂性与可近似性
Complexity and Approximability of Edge-Vertex Domination in UDG
AI总结:
本文研究单位圆盘图上的边-顶点支配集问题,证明其 NP-hard,给出 PTAS,并提出线性时间 5-近似算法。
摘要:
给定无向图 $G=(V,E)$,若顶点 $v\in V$ 与边 $e\in E$ 关联,或与 $e$ 的一条相邻边关联,则称 $v$ 被 $e$ 边-顶点(ev)支配。若 $G$ 的每个顶点都被集合 $S^{ev}\subseteq E$ 中的至少一条边 ev 支配,则 $S^{ev}$ 是 $G$ 的一个边-顶点支配集(称为 ev-dominating set,简称 EVDS)。ev 支配集的最小基数是 ev 支配数。边-顶点支配集问题旨在求最小 ev 支配数。本文证明 ev 支配集问题在单位圆盘图上是 NP-hard,并证明该问题在单位圆盘图上存在多项式时间近似方案;最后给出一个简单的 5 因子线性时间近似算法。
英文摘要:
Given an undirected graph $G=(V,E)$, a vertex $v\in V$ is edge-vertex (ev) dominated by an edge $e\in E$ if $v$ is either incident to $e$ or incident to an adjacent edge of $e$. A set $S^{ev}\subseteq E$ is an edge-vertex dominating set (referred to as \textit{ev}-dominating set and in short as \textit{EVDS}) of $G$ if every vertex of $G$ is \textit{ev}-dominated by at least one edge of $S^{ev}$. The minimum cardinality of an \textit{ev}-dominating set is the \textit{ev}-domination number. The edge-vertex dominating set problem is to find a minimum \textit{ev}-domination number. In this paper, we prove that the \textit{ev}-dominating set problem is {\tt NP-hard} on unit disk graphs. We also prove that this problem admits a polynomial-time approximation scheme on unit disk graphs. Finally, we give a simple 5-factor linear-time approximation algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。