Construction of minimum edge-fault tolerant connected dominating set in a general graph

Yaoyao Zhang, Zhao Zhang () and Ding-Zhu Du
Additional contact information
Yaoyao Zhang: Xinjiang University
Zhao Zhang: Zhejiang Normal University
Ding-Zhu Du: University of Texas at Dallas

Journal of Combinatorial Optimization, 2023, vol. 45, issue 2, No 9, 12 pages

Abstract: Abstract The Minimum connected dominating set problem (MinCDS) is a classical combinatorial optimization problem and has attached a lot of attention due to its application in wireless sensor networks (WSNs). Although the minimum k-connected m-fold dominating set problem (Min(k, m)-CDS), which takes vertex fault tolerance into consideration, has been extensively studied in recent years, studies on edge fault tolerant CDS only start very recently. In this paper, we study the edge analog of Min(k, m)-CDS, denoted as Min(k, m)-ECDS, which aims to find $$S\subseteq V(G)$$ S ⊆ V ( G ) such that the subgraph of G induced by S is k-edge connected and for any $$v\in V\setminus S$$ v ∈ V \ S , there are at least m edges between v and S. We give a greedy algorithm for Min(k, m)-ECDS on a general graph, with a theoretically guaranteed approximation ratio at most $$(2k-1)\ln \Delta +O(1)$$ ( 2 k - 1 ) ln Δ + O ( 1 ) , where $$\Delta $$ Δ is the maximum degree of G. When applied on an unit disk graph (UDG), the approximation ratio is at most $$10k-\frac{5}{k}+O(1)$$ 10 k - 5 k + O ( 1 ) when $$m\le 5$$ m ≤ 5 and $$14k+O(1)$$ 14 k + O ( 1 ) when $$m>5$$ m > 5 . In particular, our algorithm on Min(2, 2)-ECDS has approximation ratio at most 23.5, which improves the ratio 30.51 obtained in Liang et al. (Wirel Commun Mob Comput, 2021).

Keywords: Edge fault tolerance; Connected dominating set; Greedy algorithm; Approximation ratio (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-00989-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00989-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-00989-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().