2-node-connectivity network design (Q2117701): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3183655254
@@ Property / OpenAlex ID: W3183655254 / 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 @@
+Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
+Normal rank
@@ Property / cites work @@
+A polylogarithmic approximation algorithm for 2-edge-connected dominating set
+Normal rank
@@ Property / cites work @@
+Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
+Normal rank
@@ Property / cites work @@
+Pruning 2-connected graphs
@@ Property / cites work: Pruning 2-connected graphs / rank @@
+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 @@
+A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
+Normal rank
@@ Property / cites work @@
+Q4234099
@@ Property / cites work: Q4234099 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower-Stretch Spanning Trees
@@ Property / cites work: Lower-Stretch Spanning Trees / rank @@
+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 @@
+Coverings and structure of crossing families
@@ Property / cites work: Coverings and structure of crossing families / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Improved approximation for tree augmentation: saving by rewiring
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Improved methods for approximating node weighted Steiner trees and connected dominating sets.
+Normal rank
@@ Property / cites work @@
+Q5417728
@@ Property / cites work: Q5417728 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
+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 @@
+Covering a laminar family by leaf to leaf links
@@ Property / cites work: Covering a laminar family by leaf to leaf links / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:2117701