Abstract
Recently two different linear time approximation algorithms for the weighted matching problem in graphs have been suggested [5][17]. Both these algorithms have a performance ratio of 1/2. In this paper we present a set of local improvement operations and prove that it guarantees a performance ratio of 2/3. We show that a maximal set of these local improvements can be found in linear time.
To see how these local improvements behave in practice we conduct an experimental comparison of four different approximation algorithms for calculating maximum weight matchings in weighted graphs. One of these algorithms is the commonly used Greedy algorithm which achieves a performance ratio of 1/2 but has O(m log n) runtime. The other three algorithms all have linear runtime. Two of them are the above mentioned 1/2 approximation algorithms. The third algorithm may have an arbitrarily bad performance ratio but in practice produces reasonably good results. We compare the quality of the algorithms on a test set of weighted graphs and study the improvement achieved by our local improvement operations. We also do a comparison of the runtimes of all algorithms.
Supported by DFG research grant 296/6-3
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Avis, A Survey of Heuristics for the Weighted Matching Problem, Networks, Vol. 13 (1983), 475–493
R. Beier, J. F. Sibeyn, A Powerful Heuristic for Telephone Gossiping, Proc. 7th Colloquium on Structural Information and Communication Complexity, Carleton Scientific (2000), 17–35
B. Chandra, M. M. Halldórsson, Greedy local improvement and weighted set packing approximation, Journal of Algorithms, 39 (2000), 223–240
W. Cook, A. Rohe, Computing minimum-weight perfect matchings, INFORMS Journal on Computing 11 (1999), 138–148
D. E. Drake, S. Hougardy, A Simple Approximation Algorithm for the Weighted Matching Problem, Information Processing Letters 85 (2003), 211–213
C. Frömmel, A. Goede, C. Gröpl, S. Hougardy, T. Nierhoff, R. Preissner, M. Thimm, Accelerating screening of 3D protein data with a graph theoretical approach, Humboldt-Universität zu Berlin, September 2002
H. N. Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking, SODA 1990, 434–443
H. N. Gabow, R. E. Tarjan, Faster Scaling Algorithms for General Graph-Matching Problems, JACM 38 (1991), 815–853
G. Goldfarb, M. D. Grigoriadis, A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow, Annals of Operations Research 13 (1988), 83–123
M. M. Halldórsson, Approximating Discrete Collections via Local Improvements, In Proc. of Sixth SIAM/ACM Symposium on Discrete Algorithms, San Francisco (1995), 160–169
J. E. Hopcroft, R. M. Karp, An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2 (1973), 225–231
J. Magun, Greedy Matching Algorithms, an Experimental Study, ACM Journal of Experimental Algorithms, Volume 3, Article 6, 1998
K. Mehlhorn, S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing, ACM Press (1995), New York, NY
S. Micali and V. V. Vazirani, An \( O(\sqrt V E) \) Algorithm for Finding Maximum Matching in General Graphs, Proc. 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 17–27
R. H. Möhring, M. Müller-Hannemann, Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals, Algorithmica 26 (2000), 148–171
B. Monien, R. Preis, R. Diekmann, Quality Matching and Local Improvement for Multilevel Graph-Partitioning, Parallel Computing, 26(12), 2000, 1609–1634
R. Preis, Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs, Symposium on Theoretical Aspects of Computer Science, STACS 99, C. Meinel, S. Tison (eds.), Springer, LNCS 1563, 1999, 259–269
V. V. Vazirani, A Theory of Alternating Paths and Blossoms for Proving Correctness of the \( O(\sqrt V E) \) Maximum Matching Algorithm, Combinatorica 14:1 (1994), 71–109
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drake, D.E., Hougardy, S. (2003). Linear Time Local Improvements for Weighted Matchings in Graphs. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds) Experimental and Efficient Algorithms. WEA 2003. Lecture Notes in Computer Science, vol 2647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44867-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-44867-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40205-3
Online ISBN: 978-3-540-44867-9
eBook Packages: Springer Book Archive