An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788): Difference between revisions

@@ Property / cites work @@
+An improved LP-based approximation for steiner tree
+Normal rank
@@ Property / cites work @@
+Q3549697
@@ Property / cites work: Q3549697 / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph Reduction Step Preserving Element-Connectivity and Applications
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Network Design with Metric Costs
+Normal rank
@@ Property / cites work @@
+An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
+Normal rank
@@ Property / cites work @@
+Q3549695
@@ Property / cites work: Q3549695 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Vertex-Connectivity Network Design Problems
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
+Normal rank
@@ Property / cites work @@
+A note on Rooted Survivable Networks
@@ Property / cites work: A note on Rooted Survivable Networks / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank
@@ Property / cites work @@
+Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank