A New Approximation Algorithm for Minimum-Weight $(1,m)$--Connected Dominating Set

Jiao Zhou, Yingli Ran, Panos M. Pardalos +3

Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset…