Faster scaling algorithms for network problems
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
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
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
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Information Processing Letters
Distributed link scheduling with constant overhead
IEEE/ACM Transactions on Networking (TON)
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A parallel approximation algorithm for the weighted maximum matching problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A simple parallel approximation algorithm for maximum weight matching
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Video surveillance with PTZ cameras: the problem of maximizing effective monitoring time
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.89 |
We present two 2/3 - ε approximation algorithms for the maximum weight matching problem that run in time O(m log 1ε;). We give a simple and practical randomized algorithm and a somewhat more complicated deterministic algorithm. Both algorithms are exponentially faster in terms of ε than a recent algorithm by Drake and Hougardy. We also show that our algorithms can be generalized to find a 1 - ε approximation to the maximum weight matching, for any ε 0.