An approximation algorithm for minimum-cost vertex-connectivity problems
From MaRDI portal
Recommendations
- Publication:4886063
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- Approximation algorithm for the minimum connected \(k\)-path vertex cover problem
- scientific article; zbMATH DE number 1757952
- Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs
- Approximation algorithms for minimum (weight) connected k-path vertex cover
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- scientific article; zbMATH DE number 1688381
- Better algorithms for minimum weight vertex-connectivity problems
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
Cites work
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 1256642 (Why is no real title available?)
- scientific article; zbMATH DE number 1263259 (Why is no real title available?)
- scientific article; zbMATH DE number 871924 (Why is no real title available?)
- scientific article; zbMATH DE number 910889 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A minimum 3-connectivity augmentation of a graph
- A primal-dual approximation algorithm for generalized Steiner network problems
- Approximation Algorithms for Graph Augmentation
- Augmentation Problems
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Design of survivable networks
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Improved data structures for fully dynamic biconnectivity
- On the optimal vertex-connectivity augmentation
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(30)- Hitting diamonds and growing cacti
- An algorithm for minimum cost arc-connectivity orientations
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Faster approximation algorithms for weighted triconnectivity augmentation problems
- Design of survivable networks with low connectivity requirements
- On the minimum local-vertex-connectivity augmentation in graphs
- A dual-fitting \(\frac{3}{2}\)-approximation algorithm for some minimum-cost graph problems
- Better algorithms for minimum weight vertex-connectivity problems
- scientific article; zbMATH DE number 2089222 (Why is no real title available?)
- Approximating node-connectivity augmentation problems
- scientific article; zbMATH DE number 1688385 (Why is no real title available?)
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- Approximating minimum-cost edge-covers of crossing biset-families
- Improved approximation algorithms for min-cost connectivity augmentation problems
- An improved approximation algorithm for minimum-cost subset \(k\)-connectivity (extended abstract)
- An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
- scientific article; zbMATH DE number 1757952 (Why is no real title available?)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- A 3/2-approximation algorithm for some minimum-cost graph problems
- A primal–dual schema based approximation algorithm for the element connectivity problem
- Approximation algorithms for connectivity augmentation problems
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Approximating minimum size \{1,2\}-connected networks
- scientific article; zbMATH DE number 2119765 (Why is no real title available?)
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- Pruning 2-connected graphs
- scientific article; zbMATH DE number 910889 (Why is no real title available?)
This page was built for publication: An approximation algorithm for minimum-cost vertex-connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679445)
