Work

An $\tilde{O}(\log^2 n)$-approximation algorithm for $2$-edge-connected dominating set

Year: 2019

Type: preprint

Abstract: In the Connected Dominating Set problem we are given a graph $G=(V,E)$ and seek a minimum size dominating set $S \subseteq V$ 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 $\tilde{O}(\log^2n)$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1912.09662

Authors: Belgi, Amir, Nutov, Zeev

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4394646744

Cites:

Cited by: 3

Related to: 10