# Approximating k-connected m-dominating sets

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

## תקציר

A subset S of nodes in a graph G is a k-connected m-dominating set ((k, m)-cds) if the subgraph G[S] induced by S is k-connected and every v ∈ V \ S has at least m neighbors in S. In the k-Connected m-Dominating Set ((k, m)-CDS) problem the goal is to find a minimum weight (k, m)-cds in a node-weighted graph. For m ≥ k we obtain the following approximation ratios. For general graphs our ratio O(k ln n) improves the previous best ratio O(k2 ln n) of [26] and matches the best known ratio for unit weights of [34]. For unit disk graphs we improve the ratio O(k ln k) of [26] to min { mmk, k2/3 · O(ln2 k) – this is the first sublinear ratio for the problem, and the first polylogarithmic ratio O(ln2 k)/ when m ≥ (1 + )k; furthermore, we obtain ratio min {mmk, k · O(ln2 k) for uniform weights. These results are obtained by showing the same ratios for the Subset k-Connectivity problem when the set of terminals is an m-dominating set.

שפה מקורית אנגלית 28th Annual European Symposium on Algorithms, ESA 2020 Fabrizio Grandoni, Grzegorz Herman, Peter Sanders Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing 9783959771627 https://doi.org/10.4230/LIPIcs.ESA.2020.73 פורסם - 1 אוג׳ 2020 28th Annual European Symposium on Algorithms, ESA 2020 - Virtual, Pisa, איטליהמשך הזמן: 7 ספט׳ 2020 → 9 ספט׳ 2020

### סדרות פרסומים

שם Leibniz International Proceedings in Informatics, LIPIcs 173 1868-8969

### כנס

כנס 28th Annual European Symposium on Algorithms, ESA 2020 איטליה Virtual, Pisa 7/09/20 → 9/09/20