Approximating k-connected m-dominating sets

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publication28th Annual European Symposium on Algorithms, ESA 2020
EditorsFabrizio Grandoni, Grzegorz Herman, Peter Sanders
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771627
StatePublished - 1 Aug 2020
Event28th Annual European Symposium on Algorithms, ESA 2020 - Virtual, Pisa, Italy
Duration: 7 Sep 20209 Sep 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference28th Annual European Symposium on Algorithms, ESA 2020
CityVirtual, Pisa

Bibliographical note

Publisher Copyright:
© Zeev Nutov.


  • Approximation algorithm
  • M-dominating set
  • Rooted subset k-connectivity
  • Subset k-connectivity
  • k-connected graph

Cite this