An exact algorithm for minimum CDS with shortest path constraint in wireless networks
From MaRDI portal
(Redirected from Publication:537641)
Recommendations
- Efficient distributed algorithms for topology control problem with shortest path constraints
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
- PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
- Efficient algorithm for finding minimum connected dominating set in wireless sensor networks
- Approximation algorithms for connected dominating sets
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A greedy approximation for minimum connected dominating sets
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximation algorithms for connected dominating sets
- Approximations for Steiner trees with minimum number of Steiner points
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Unit disk graphs
Cited in
(5)- On connected dominating sets of restricted diameter
- The probabilistic and reliable connected power dominating set problems
- Efficient distributed algorithms for topology control problem with shortest path constraints
- Minimum edge blocker dominating set problem
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
This page was built for publication: An exact algorithm for minimum CDS with shortest path constraint in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537641)
