Pages that link to "Item:Q2326407"
From MaRDI portal
The following pages link to On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407):
Displaying 5 items.
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← 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)