Improved approximations for relative survivable network design
From MaRDI portal
Publication:6574948
Cites work
- scientific article; zbMATH DE number 1263227 (Why is no real title available?)
- scientific article; zbMATH DE number 7829257 (Why is no real title available?)
- scientific article; zbMATH DE number 7788512 (Why is no real title available?)
- A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
- A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A primal-dual approximation algorithm for generalized Steiner network problems
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Approximating fault-tolerant group-Steiner problems
- Approximating rooted Steiner networks
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Compact cactus representations of all non-trivial min-cuts
- Efficient and Simple Algorithms for Fault-Tolerant Spanners
- Epic fail: emulators can tolerate polynomially many edge faults for free
- Fault tolerant spanners for general graphs
- Fault-tolerant spanners
- Flexible Graph Connectivity
- Important separators and parameterized algorithms
- Maintaining the classes of 4-edge-connectivity in a graph on-line
- Maintenance of 2- and 3-Edge-Connected Components of Graphs II
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
- Relative survivable network design
- The parameterized complexity of the survivable network design problem
This page was built for publication: Improved approximations for relative survivable network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574948)
