A polylogarithmic approximation algorithm for 2-edge-connected dominating set

Abstract

In the Connected Dominating Set (CDS) problem we are given a graph G and seek a min-size dominating set S such that the subgraph G[S] of G induced by S is connected. In the 2-Edge-Connected Dominating Set problem G[S] should be 2-edge-connected. We give the first non-trivial approximation algorithm for this problem, with expected approximation ratio O(log2⁡n⋅log⁡log⁡n⋅(log⁡log⁡log⁡n)3). We also show that the Subset Steiner CDS problem is approximation equivalent to the Group Steiner Tree problem.