Pages that link to "Item:Q443711"
From MaRDI portal
The following pages link to Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711):
Displaying 4 items.
- The connected domination number of grids (Q831725) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
