Power optimization for connectivity problems
From MaRDI portal
Recommendations
Cites work
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A Parallel Repetition Theorem
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- An application of submodular flows
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
- Approximating node connectivity problems via set covers
- Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
- Biconnectivity approximations and graph carvings
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
- Improved Approximation Algorithms for Uniform Connectivity Problems
- On the hardness of approximating spanners
- Optimization, approximation, and complexity classes
- Power consumption in packet radio networks
Cited in
(25)- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- On Minimum Power Connectivity Problems
- Approximating minimum-power degree and connectivity problems
- Wireless network design via 3-decompositions
- Power Optimization for Connectivity Problems
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- The connected Vietoris powerlocale
- Approximating minimum-power edge-covers and 2,3-connectivity
- New results on the complexity of the Max- and Min-Rep problems
- Approximate min-power strong connectivity
- Approximating Minimum-Power Degree and Connectivity Problems
- Minimum shared‐power edge cut
- Improved approximation algorithms for minimum power covering problems
- Survivable network activation problems
- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
- Min-power strong connectivity
- On min-power Steiner tree
- Improved approximation algorithms for label cover problems
- On minimum power connectivity problems
- Approximating Steiner Networks with Node Weights
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- 1.61-approximation for min-power strong connectivity with two power levels
- Approximating activation edge-cover and facility location problems
- scientific article; zbMATH DE number 7561664 (Why is no real title available?)
This page was built for publication: Power optimization for connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877193)
