Pages that link to "Item:Q1958631"
From MaRDI portal
The following pages link to A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631):
Displaying 3 items.
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
