PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
From MaRDI portal
(Redirected from Publication:3066162)
Recommendations
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Cited in
(9)- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- A PTAS for minimum d-hop connected dominating set in growth-bounded graphs
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks
- The wake up dominating set problem
- A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
This page was built for publication: PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066162)