An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
From MaRDI portal
Cited in
(21)- An efficient approximation algorithm for the survivable network design problem
- Black-box reductions for cost-sharing mechanism design
- Approximating subset \(k\)-connectivity problems
- Approximating node-connectivity augmentation problems
- Approximating source location and star survivable network problems
- Approximability of capacitated network design
- An improved approximation algorithm for minimum-cost subset k-connectivity (extended abstract)
- Degree constrained node-connectivity problems
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Binary representations of underdetermined data and superimposed codes
- Approximating source location and star survivable network problems
- Approximating survivable networks with \(\beta \)-metric costs
- Black-box reductions for cost-sharing mechanism design
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- The parameterized complexity of the survivable network design problem
- Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity
- Streaming algorithms for network design
- A note on labeling schemes for graph connectivity
- Approximating fault-tolerant group-Steiner problems
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
- A note on Rooted Survivable Networks
This page was built for publication: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171193)
