The auction algorithm: a distributed relaxation method for the assignment problem
Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A natural randomization strategy for multicommodity flow and related algorithms
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
An optimal deterministic algorithm for online b-matching
Theoretical Computer Science
SIAM Journal on Computing
Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Constrained multi-object auctions and b-matching
Information Processing Letters
Introduction to Algorithms
Tractable combinatorial auctions and b-matching
Artificial Intelligence
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
Proceedings of the 11th ACM conference on Electronic commerce
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
| Hi-index | 0.00 |
We relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. We view each node on the left of a bipartite graph as having balls that it can throw into nodes on the right (bins) to which it is adjacent. We show that several simple algorithms based on throwing balls into bins deliver a near-perfect fractional matching, where a perfect fractional matching is a weighted subgraph on all nodes with nonnegative weights on edges so that the total weight incident at each node is 1.