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

Amir Belgi; Zeev Nutov

doi:10.1016/j.ipl.2021.106175

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

Amir Belgi, Zeev Nutov

Computer Science

Open University of Israel

Research output: Contribution to journal › Article › peer-review

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(log²⁡n⋅log⁡log⁡n⋅(log⁡log⁡log⁡n)³). We also show that the SUBSET STEINER CDS problem is approximation equivalent to the GROUP STEINER TREE problem.

Original language	English
Article number	106175
Journal	Information Processing Letters
Volume	173
DOIs	https://doi.org/10.1016/j.ipl.2021.106175
State	Published - Jan 2022

Keywords

2-edge-connected
Approximation algorithms
Dominating set

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2021.106175

Cite this

@article{d68b676cb3404bc0bb02672a9cd806a1,

title = "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.",

keywords = "2-edge-connected, Approximation algorithms, Dominating set",

author = "Amir Belgi and Zeev Nutov",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2022",

month = jan,

doi = "10.1016/j.ipl.2021.106175",

language = "الإنجليزيّة",

volume = "173",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

AU - Belgi, Amir

AU - Nutov, Zeev

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(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.

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(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.

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 - مقالة

SN - 0020-0190

VL - 173

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106175

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this