Algorithms for minimum connected capacitated dominating set problem
From MaRDI portal
Recommendations
- Algorithms for Minimum m-Connected k-Dominating Set Problem
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- Efficient algorithm for finding minimum connected dominating set in wireless sensor networks
- Approximation algorithms for connected dominating sets
Cites work
Cited in
(8)- A distributed approximation algorithm for the bottleneck connected dominating set problem
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Efficient algorithm for finding minimum connected dominating set in wireless sensor networks
- Algorithms for Minimum m-Connected k-Dominating Set Problem
- Connected dominating set. Theory and applications
- Algorithms for the minimum weight k-fold (connected) dominating set problem
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube
This page was built for publication: Algorithms for minimum connected capacitated dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007757)