TY - JOUR
T1 - A polylogarithmic approximation algorithm for 2-edge-connected dominating set
AU - Belgi, Amir
AU - Nutov, Zeev
N1 - Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2022/1
Y1 - 2022/1
N2 - 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(log2n⋅loglogn⋅(logloglogn)3). We also show that the SUBSET STEINER CDS problem is approximation equivalent to the GROUP STEINER TREE problem.
AB - 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(log2n⋅loglogn⋅(logloglogn)3). We also show that the SUBSET STEINER CDS problem is approximation equivalent to the GROUP STEINER TREE problem.
KW - 2-edge-connected
KW - Approximation algorithms
KW - Dominating set
UR - http://www.scopus.com/inward/record.url?scp=85112067180&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2021.106175
DO - 10.1016/j.ipl.2021.106175
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85112067180
SN - 0020-0190
VL - 173
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106175
ER -