arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.06576cs.DS
收藏

改进的简化连通控制和简化边点控制

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination

Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos

摘要:

我们考虑经典\emph{Connected Dominating Set}问题(BCDS)的\emph{Budgeted}版本。给定一个图$G$和一个预算$k$,我们寻求一个连通子集,最多$k$顶点最大化$G$中的支配顶点数。我们改进了以前的$(1-1/e)/13$近似[Khuller,Purohit,Sarpatwar,\ \emph{SODA 2014} ]通过引入一种新的方法进行树分解的算法的最后一部分的分析。这种新方法提供了$(1-1/e)/12$近似保证。通过推广算法第一部分的分析,我们能够对其进行适当的修改,并获得对$(1-e^{-7/8})/11$的进一步改进。另一方面,我们证明了一个$(1-1/e+ε)$不可逼近界,任何$ε> 0$。我们还研究了\emph{edge-vertex domination}变体,其中一条边支配其端点和所有邻近端点的顶点。在\emph{Budgeted Edge-Vertex Domination}(BEVD)中,我们给出了一个图$G$和一个预算$k$,我们寻找一个不一定连通的$k$边的子集,使得$G$中的支配顶点数最大化。我们证明了存在一个$(1-1/e)$ -近似算法。此外,对于任何$ε> 0$,我们提出了一个$(1-1/e+ε)$ -不可逼近的结果,从\emph{maximum coverage}问题的间隙保持减少。最后,我们研究的“双”\emph{Partial Edge-Vertex Domination}(PEVD)的问题,其中一个图$G$和配额$n'$。我们的目标是选择一个最小尺寸的边集,以控制至少$G$中的$n'$顶点。在这种情况下,我们提出了一个$H(n')$ -近似算法的减少\emph{partial cover}问题。

英文摘要:

We consider the \emph{Budgeted} version of the classical \emph{Connected Dominating Set} problem (BCDS). Given a graph $G$ and a budget $k$, we seek a connected subset of at most $k$ vertices maximizing the number of dominated vertices in $G$. We improve over the previous $(1-1/e)/13$ approximation in [Khuller, Purohit, and Sarpatwar,\ \emph{SODA 2014}] by introducing a new method for performing tree decompositions in the analysis of the last part of the algorithm. This new approach provides a $(1-1/e)/12$ approximation guarantee. By generalizing the analysis of the first part of the algorithm, we are able to modify it appropriately and obtain a further improvement to $(1-e^{-7/8})/11$. On the other hand, we prove a $(1-1/e+ε)$ inapproximability bound, for any $ε> 0$. We also examine the \emph{edge-vertex domination} variant, where an edge dominates its endpoints and all vertices neighboring them. In \emph{Budgeted Edge-Vertex Domination} (BEVD), we are given a graph $G$, and a budget $k$, and we seek a, not necessarily connected, subset of $k$ edges such that the number of dominated vertices in $G$ is maximized. We prove there exists a $(1-1/e)$-approximation algorithm. Also, for any $ε> 0$, we present a $(1-1/e+ε)$-inapproximability result by a gap-preserving reduction from the \emph{maximum coverage} problem. Finally, we examine the "dual" \emph{Partial Edge-Vertex Domination} (PEVD) problem, where a graph $G$ and a quota $n'$ are given. The goal is to select a minimum-size set of edges to dominate at least $n'$ vertices in $G$. In this case, we present a $H(n')$-approximation algorithm by a reduction to the \emph{partial cover} problem.

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

↑