A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation (Q6499344): 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 @@
+A simple LP-based approximation algorithm for the matching augmentation problem
+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 @@
+Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for the Matching Augmentation Problem
+Normal rank
@@ Property / cites work @@
+The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
+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 @@
+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-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 @@
+Circle graphs are quadratically χ‐bounded
@@ Property / cites work: Circle graphs are quadratically χ‐bounded / 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 @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Q5501264
@@ Property / cites work: Q5501264 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding
+Normal rank
@@ Property / cites work @@
+On the cycle augmentation problem: hardness and approximation algorithms
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+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 chromatic number of multiple interval graphs and overlap graphs
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+The complexity of domination problems in circle graphs
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Augmentation
@@ Property / cites work: Approximation Algorithms for Graph Augmentation / 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 @@
+TREEWIDTH OF CIRCLE GRAPHS
@@ Property / cites work: TREEWIDTH OF CIRCLE GRAPHS / rank @@
+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 @@
+An output sensitive algorithm for computing a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Q5111750
@@ Property / cites work: Q5111750 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of Circle Graphs
@@ Property / cites work: Recognition of Circle Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast distance multiplication of unit-Monge matrices
+Normal rank
@@ Property / cites work @@
+Q3787505
@@ Property / cites work: Q3787505 / rank @@
+Normal rank