Approximating minimum-power degree and connectivity problems
From MaRDI portal
(Redirected from Publication:547290)
Recommendations
- Approximating Minimum-Power Degree and Connectivity Problems
- Approximate min-power strong connectivity
- Approximating minimum-power edge-covers and 2,3-connectivity
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Approximation algorithms for degree-constrained minimum-cost network-design problems
- Approximating minimum size \{1,2\}-connected networks
Cites work
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximation algorithms for combinatorial problems
- Network lifetime and power assignment in ad hoc wireless networks
- On Minimum Power Connectivity Problems
- Power assignment for k-connectivity in wireless ad hoc networks
- Power optimization for connectivity problems
- The dense \(k\)-subgraph problem
Cited in
(10)- On minimum power connectivity problems
- Power Optimization for Connectivity Problems
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
- Survivable network design problems in wireless networks
- Power assignment for k-connectivity in wireless ad hoc networks
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- On Minimum Power Connectivity Problems
- Approximating Minimum-Power Degree and Connectivity Problems
- Improved approximation algorithms for minimum power covering problems
- Approximating minimum-power edge-covers and 2,3-connectivity
This page was built for publication: Approximating minimum-power degree and connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547290)
