Node connectivity augmentation via iterative randomized rounding (Q6038664): Difference between revisions

@@ Property / Wikidata QID @@
+Q114228485
@@ Property / Wikidata QID: Q114228485 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3191755649
@@ Property / OpenAlex ID: W3191755649 / rank @@
+Normal rank
@@ Property / cites work @@
+Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms to Preserve Connectivity
@@ Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Thek-Steiner Ratio in Graphs
@@ Property / cites work: Thek-Steiner Ratio in Graphs / 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 @@
+On the integrality ratio for tree augmentation
@@ Property / cites work: On the integrality ratio for tree augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
+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 @@
+The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
+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 @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for tree augmentation: saving by rewiring
+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 @@
+LP-relaxations for tree augmentation
@@ Property / cites work: LP-relaxations for tree augmentation / rank @@
+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 @@
+Q5111750
@@ Property / cites work: Q5111750 / rank @@
+Normal rank
@@ Property / cites work @@
+-node-connectivity network design
@@ Property / cites work: 2-node-connectivity network design / rank @@
+Normal rank
@@ Property / cites work @@
+A 4 + <i>ε</i> approximation for <i>k</i>-connected subgraphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+The node-weighted steiner tree problem
@@ Property / cites work: The node-weighted steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for node-weighted Steiner tree in unit disk graphs
+Normal rank