scientific article; zbMATH DE number 910889
From MaRDI portal
Recommendations
- An approximation algorithm for minimum-cost vertex-connectivity problems
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- scientific article; zbMATH DE number 1003253
- An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design
- scientific article; zbMATH DE number 1263260
Cited in
(24)- Hitting diamonds and growing cacti
- An algorithm for minimum cost arc-connectivity orientations
- Approximation Algorithms for Network Design with Metric Costs
- Pruning 2-connected 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?)
- scientific article; zbMATH DE number 1688385 (Why is no real title available?)
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Network design via iterative rounding of setpair relaxations
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- 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
- scientific article; zbMATH DE number 1757952 (Why is no real title available?)
- Design of Survivable Networks: A survey
- A 3/2-approximation algorithm for some minimum-cost graph problems
- Primal-dual-based algorithms for a directed network design problem
- A primal–dual schema based approximation algorithm for the element connectivity problem
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Approximating minimum size \{1,2\}-connected networks
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- scientific article; zbMATH DE number 2119765 (Why is no real title available?)
- Single-sink network design with vertex connectivity requirements
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886063)
