A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
From MaRDI portal
Recommendations
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- Better algorithms for minimum weight vertex-connectivity problems
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
Cited in
(15)- On k-connectivity problems with sharpened triangle inequality
- Approximating minimum-power edge-covers and 2,3-connectivity
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Power assignment for k-connectivity in wireless ad hoc networks
- A 4+ approximation for k-connected subgraphs
- Approximating subset \(k\)-connectivity problems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Parameterized algorithms for node connectivity augmentation problems
- A logarithmic approximation algorithm for the activation edge-multicover problem
- On minimum power connectivity problems
This page was built for publication: A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719339)
