A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
From MaRDI portal
Recommendations
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Better algorithms for minimum weight vertex-connectivity problems
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
Cited in
(28)- 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
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- A 4+ approximation for k-connected subgraphs
- Relay placement for two-connectivity
- Approximating subset \(k\)-connectivity problems
- On extremal \(k\)-outconnected graphs
- Improved approximation algorithms for single-tiered relay placement
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- scientific article; zbMATH DE number 1542609 (Why is no real title available?)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Degree constrained node-connectivity problems
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- Approximating survivable networks with \(\beta \)-metric costs
- 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
- Generating 3-vertex connected spanning subgraphs
This page was built for publication: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719338)
