A simpler linear time $ \frac{2}{3} - \varepsilon$ approximation for maximum weight matching (Q2390325): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2004.05.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2014533003
@@ Property / OpenAlex ID: W2014533003 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q4426349
@@ Property / cites work: Q4426349 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple approximation algorithm for the weighted matching problem
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+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 @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4251057
@@ Property / cites work: Q4251057 / rank @@
+Normal rank

A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325): Difference between revisions