An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3215578882
@@ Property / OpenAlex ID: W3215578882 / rank @@
+Normal rank
@@ Property / cites work @@
+Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
+Normal rank
@@ Property / cites work @@
+A simple LP-based approximation algorithm for the matching augmentation problem
+Normal rank
@@ Property / cites work @@
+Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
+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. 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 @@
+A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
+Normal rank
@@ Property / cites work @@
+Q3586724
@@ Property / cites work: Q3586724 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607935
@@ Property / cites work: Q4607935 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+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 @@
+Improved approximation for tree augmentation: saving by rewiring
+Normal rank
@@ Property / cites work @@
+A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / 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 @@
+Iterative Methods in Combinatorial Optimization
@@ Property / cites work: Iterative Methods in Combinatorial Optimization / 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 @@
+On the tree augmentation problem
@@ Property / cites work: On the tree augmentation problem / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+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
@@ Property / cites work @@
+Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5883280