The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772): Difference between revisions

@@ Property / author @@
-Joseph Cheriyan
@@ Property / author: Joseph Cheriyan / rank @@
-Normal rank
@@ Property / author @@
+Joseph Cheriyan
@@ Property / author: Joseph Cheriyan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3105989759
@@ Property / OpenAlex ID: W3105989759 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07816
@@ Property / arXiv ID: 1810.07816 / rank @@
+Normal rank
@@ Property / cites work @@
+Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / 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 @@
+On the relationship between the biconnectivity augmentation and traveling salesman problems
+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 @@
+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 @@
+New inapproximability bounds for TSP
@@ Property / cites work: New inapproximability bounds for TSP / 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 @@
+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 @@
+Q2753746
@@ Property / cites work: Q2753746 / rank @@
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank