Pages that link to "Item:Q5189986"
From MaRDI portal
The following pages link to EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986):
Displayed 6 items.
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
