Survivable network activation problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485526 (Why is no real title available?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A note on Rooted Survivable Networks
- Approximating k-node Connected Subgraphs via Critical Graphs
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating Steiner networks with node-weights
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Approximating node connectivity problems via set covers
- Approximating subset \(k\)-connectivity problems
- Approximation algorithms for combinatorial problems
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- On minimum power connectivity problems
- Power optimization for connectivity problems
- Rooted \(k\)-connections in digraphs
- Survivable network design problems in wireless networks
Cited in
(9)- Spider covering algorithms for network design problems
- Minimum shared‐power edge cut
- Minimum activation cost edge-disjoint paths in graphs with bounded tree-width
- Approximation algorithms for disjoint \(st\)-paths with minimum activation cost
- Survivable network design problems in wireless networks
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- Minimum activation cost node-disjoint paths in graphs with bounded treewidth
- Survivable network activation problems
- Spider covers for prize-collecting network activation problem
This page was built for publication: Survivable network activation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386909)
