Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028): Difference between revisions

@@ Property / cites work @@
+Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
+Normal rank
@@ Property / cites work @@
+Node connectivity augmentation via iterative randomized rounding
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms to Preserve Connectivity
@@ Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
+Normal rank
@@ Property / cites work @@
+Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
+Normal rank
@@ Property / cites work @@
+Approximating (unweighted) tree augmentation via lift-and-project. II
+Normal rank
@@ Property / cites work @@
+Q4938792
@@ Property / cites work: Q4938792 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
+Normal rank
@@ Property / cites work @@
+A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
+Normal rank
@@ Property / cites work @@
+A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
+Normal rank
@@ Property / cites work @@
+Q4607935
@@ Property / cites work: Q4607935 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for tree augmentation: saving by rewiring
+Normal rank
@@ Property / cites work @@
+On the cycle augmentation problem: hardness and approximation algorithms
+Normal rank
@@ Property / cites work @@
+A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Augmentation
@@ Property / cites work: Approximation Algorithms for Graph Augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
+Normal rank
@@ Property / cites work @@
+An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
+Normal rank
@@ Property / cites work @@
+-node-connectivity network design
@@ Property / cites work: 2-node-connectivity network design / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+On the tree augmentation problem
@@ Property / cites work: On the tree augmentation problem / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
+Normal rank