A simple approximation algorithm for the weighted matching problem

Authors:
Doratha E. Drake;Stefan Hougardy
Affiliations:
Institut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany;Institut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany
Venue:
Information Processing Letters
Year:
2003

Citing 5
Cited 16

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
Quality matching and local improvement for multilevel graph-partitioning

Parallel Computing - Special issue on graph partioning and parallel computing
Computing Minimum-Weight Perfect Matchings

INFORMS Journal on Computing
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 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)
Computing steiner minimum trees in Hamming metric

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up

ACM SIGCOMM Computer Communication Review
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
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Linear time local improvements for weighted matchings in graphs

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Engineering algorithms for approximate weighted matching

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A simple parallel approximation algorithm for maximum weight matching

Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
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
Algebraic Distance on Graphs

SIAM Journal on Scientific Computing
Engineering graph partitioning algorithms

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Approximate weighted matching on emerging manycore and multithreaded architectures

International Journal of High Performance Computing Applications
Cross-lingual entity matching and infobox alignment in Wikipedia

Information Systems
Linear-Time Approximation for Maximum Weight Matching

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.