Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
Data path allocation based on bipartite weighted matching
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming: Series A and B
Sublinear-time parallel algorithms for matching and related problems
Journal of Algorithms
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The probabilistic relationship between the assignment and asymmetric traveling salesman problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Network Flows and Matching: First DIMACS Implementation Challenge
Network Flows and Matching: First DIMACS Implementation Challenge
SIAM Journal on Discrete Mathematics
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the 15th ACM symposium on Access control models and technologies
Spectral-Driven Isometry-Invariant Matching of 3D Shapes
International Journal of Computer Vision
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Isometry-invariant matching of point set surfaces
EG 3DOR'08 Proceedings of the 1st Eurographics conference on 3D Object Retrieval
Measuring Relatedness Between Scientific Entities in Annotation Datasets
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
| Hi-index | 0.00 |
Let G = (V1 ∪ V2, E) be a bipartite graph on n nodes and m edges and let $w : E \rightarrow {\mathbb R}_{+}$ be a weight function on the edges. We give several fast algorithms for computing a minimum weight (perfect) matching for a given complete bipartite graph (i.e. m = n2) by pruning the edge set. The algorithm will also output an upper bound on the achieved approximation factor. Under the assumption that the edge weights are uniformly distributed, we show that our algorithm will compute an optimal solution with high probability. From this we deduce an algorithm with fast expected running time that will always compute an optimal solution. For real edge weights we achieve a running time of O(n2logn) and for integer edge weights a running time of O(n2).