Pages that link to "Item:Q1037372"

The following pages link to A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372):

Displaying 6 items.

• A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
• Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
• A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← 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)
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)