Pages that link to "Item:Q5244687"
From MaRDI portal
The following pages link to A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687):
Displaying 5 items.
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890) (← links)
- Approximation and Online Algorithms (Q5898481) (← links)