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

Amir Belgi, Zeev Nutov

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number106175
JournalInformation Processing Letters
StatePublished - Jan 2022

Bibliographical note

Publisher Copyright:
© 2021 Elsevier B.V.


  • 2-edge-connected
  • Approximation algorithms
  • Dominating set


Dive into the research topics of 'A polylogarithmic approximation algorithm for 2-edge-connected dominating set'. Together they form a unique fingerprint.

Cite this