Algorithm and complexity of the two disjoint connected dominating sets problem on trees

Xianliang Liu, Zishen Yang and Wei Wang

Applied Mathematics and Computation, 2018, vol. 337, issue C, 419-427

Abstract: In this paper, we consider a variation of the classic dominating set problem - The Two Disjoint Connected Dominating Sets (DCDS) problem, which finds applications in many real domains including wireless sensor networks. In the DCDS problem, we are given a graph G=(V,E) and required to find a new edge set E′ with minimum cardinality such that the resulting new graph after the adding of E′ has a pair of disjoint connected dominating sets. This problem is very hard in general graphs, and we show that it is NP-hard even restricted to trees. We also present a polynomial time approximation algorithm for the DCDS problem for arbitrary trees with performance ratio 32 asymptotically.

Keywords: Connected dominating set; Disjoint connected dominating sets; NP-hard; Approximation algorithm (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304466
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:337:y:2018:i:c:p:419-427

DOI: 10.1016/j.amc.2018.05.037

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().