TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
From MaRDI portal
Publication:5189988
DOI10.1142/S1793830909000361zbMath1184.68649MaRDI QIDQ5189988
Qinghai Liu, Zhao Zhang, Deying Li
Publication date: 11 March 2010
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Related Items (8)
Two algorithms for minimum 2-connected \(r\)-hop dominating set ⋮ A greedy algorithm for the fault-tolerant connected dominating set in a general graph ⋮ Fault-tolerant total domination via submodular function approximation ⋮ Progress on fault-tolerant locating-dominating sets ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Approximation algorithm for partial set multicover versus full set multicover ⋮ A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
Cites Work
- A greedy approximation for minimum connected dominating sets
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- Unit disk graphs
- Approximation algorithms for connected dominating sets
- Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
This page was built for publication: TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
