Approximating $k$-connected $m$-dominating sets
arXiv: Data Structures and Algorithms, 2019.
A subset $S$ of nodes a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v in V setminus S$ has at least $m$ neighbors $S$. In the $k$-Connected $m$-Dominating Set ($(k,m)$-CDS) problem the goal is to find a minimum weight $(k,m)$-cds a node-weighted graph. ...更多
下载 PDF 全文