Pages that link to "Item:Q972357"
From MaRDI portal
The following pages link to On minimum power connectivity problems (Q972357):
Displaying 14 items.
- Survivable network activation problems (Q386909) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Exact algorithms for the minimum power symmetric connectivity problem in wireless networks (Q1781561) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Approximate min-power strong connectivity (Q2870520) (← links)
- Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks (Q3296835) (← links)
- Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks (Q5216451) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)