Approximating minimum size \{1,2\}-connected networks (Q1861563): Difference between revisions

@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840352
@@ Property / cites work: Q3840352 / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Q4537740
@@ Property / cites work: Q4537740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140408
@@ Property / cites work: Q3140408 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762522
@@ Property / cites work: Q2762522 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Q4252426
@@ Property / cites work: Q4252426 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank
@@ Property / cites work @@
+Q2753746
@@ Property / cites work: Q2753746 / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for generalized Steiner network problems
+Normal rank