An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning
Journal of Global Optimization
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
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
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Engineering graph partitioning algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Advanced coarsening schemes for graph partitioning
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a recent path heuristic. Surprisingly, this quite simple algorithm performs very well, both in terms of running time and solution quality, and, though some other methods have a better theoretical performance, it ranks among the best algorithms.