Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100): Difference between revisions

@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A simple approximation algorithm for the weighted matching problem
+Normal rank
@@ Property / cites work @@
+Linear-Time Approximation for Maximum Weight Matching
+Normal rank
@@ Property / cites work @@
+Scaling Algorithms for Weighted Matching in General Graphs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414633
@@ Property / cites work: Q4414633 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
+Normal rank
@@ Property / cites work @@
+Data Structures for Weighted Matching and Extensions to             <i>b</i>             -matching and             <i>f</i>             -factors
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Faster Scaling Algorithms for Network Problems
@@ Property / cites work: Faster Scaling Algorithms for Network Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank