scientific article; zbMATH DE number 910889
From MaRDI portal
zbMATH Open0848.05046MaRDI QIDQ4886063FDOQ4886063
Authors: R. Ravi, David P. Williamson 
Publication date: 22 August 1996
Title of this publication is not available (Why is that?)
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
approximation algorithmnetwork designedge-connectivityvertex-connectivityvertex-disjoint pathsoptimal cost
Cited In (23)
- Pruning 2-connected graphs
- Title not available (Why is that?)
- A dual-fitting \(\frac{3}{2}\)-approximation algorithm for some minimum-cost graph problems
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- Title not available (Why is that?)
- Design of Survivable Networks: A survey
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- An algorithm for minimum cost arc-connectivity orientations
- Approximation Algorithms for Network Design with Metric Costs
- Approximating minimum size \{1,2\}-connected networks
- Hitting diamonds and growing cacti
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design
- Network design via iterative rounding of setpair relaxations
- Primal-dual-based algorithms for a directed network design problem
- Single-sink network design with vertex connectivity requirements
- Better algorithms for minimum weight vertex-connectivity problems
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- A primal–dual schema based approximation algorithm for the element connectivity problem
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)
