Improved approximation algorithms for $k$-connected $m$-dominating set problems

Zeev Nutov

A graph is $k$-connected if it has $k$ internally-disjoint paths between every pair of nodes. A subset $S$ of nodes in a graph $G$ is a $k$-connected set if the subgraph $G[S]$ ind…