Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs

Takuro Fukunaga

Given an undirected graph on a node set $V$ and positive integers $k$ and $m$, a $k$-connected $m$-dominating set ($(k,m)$-CDS) is defined as a subset $S$ of $V$ such that each nod…