On computing an optimal semi-matching (Q2408093): Difference between revisions

@@ Property / cites work @@
+A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Distributed 2-Approximation Algorithm for the Semi-matching Problem
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Semi-Matching Problems
@@ Property / cites work: Faster Algorithms for Semi-Matching Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Semi-matchings for bipartite graphs and load balancing
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing Average Flow Time with Parallel Machines
+Normal rank
@@ Property / cites work @@
+Maximum semi-matching problem in bipartite graphs
@@ Property / cites work: Maximum semi-matching problem in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Semi-matchings in Streaming and in Two-Party Communication
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank