Pages that link to "Item:Q443711"

The following pages link to Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711):

Displayed 2 items.

• 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)