Pages that link to "Item:Q2352346"
From MaRDI portal
The following pages link to PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346):
Displaying 3 items.
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)