article

A simple approximation algorithm for the weighted matching problem

Authors:

Doratha E. Drake,

Stefan HougardyAuthors Info & Claims

Information Processing Letters, Volume 85, Issue 4

Pages 211 - 213

https://doi.org/10.1016/S0020-0190(02)00393-9

Published: 28 February 2003 Publication History

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.

References

[1]

{1} W. Cook, A. Rohe, Computing minimum-weight perfect matchings, INFORMS J. Comput. 11 (1999) 138-148.

Crossref

Google Scholar

[2]

{2} H.N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in: Proc. SODA'90, 1990, pp. 434-443.

Crossref

Google Scholar

[3]

{3} H.N. Gabow, R.E. Tarjan, Faster scaling algorithms for general graph-matching problems, J. ACM 38 (4) (1991) 815-853.

Digital Library

Google Scholar

[4]

{4} S. Micali, V.V. Vazirani, An O(√V E) algorithm for finding maximum matching in general graphs, in: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 17-27.

Digital Library

Google Scholar

[5]

{5} R.H. Möhring, M. Müller-Hannemann, Complexity and modeling aspects of mesh refinement into quadrilaterals, Algorithmica 26 (2000) 148-171.

Crossref

Google Scholar

[6]

{6} B. Monien, R. Preis, R. Diekmann, Quality matching and local improvement for multilevel graph-partitioning, Parallel Comput. 26 (12) (2000) 1609-1634.

Digital Library

Google Scholar

[7]

{7} R. Preis, Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs, in: C. Meinel, S. Tison (Eds.), Symposium on Theoretical Aspects of Computer Science, STACS 99, in: Lecture Notes in Comput. Sci., Vol. 1563, Springer, Berlin, 1999, pp. 259-269.

Crossref

Google Scholar

[8]

{8} V.V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O(√V E) maximum matching algorithm, Combinatorica 14 (1) (1994) 71-109.

Crossref

Google Scholar

Cited By

View all

Huang SSu HOshman RNolin AHalldorsson MBalliu A(2023)(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel SettingsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594570(44-54)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594570
Brüggemann ABreuer MKlinger ASchneider TMeyer UHong YWang L(2022)Secure Maximum Weight Matching Approximation on General GraphsProceedings of the 21st Workshop on Privacy in the Electronic Society10.1145/3559613.3563209(83-87)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3559613.3563209
Angriman EBoroń MMeyerhenke H(2022)A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted MatchingACM Journal of Experimental Algorithmics10.1145/352922827(1-41)Online publication date: 7-Jul-2022
https://dl.acm.org/doi/10.1145/3529228
Show More Cited By

Index Terms

A simple approximation algorithm for the weighted matching problem

Recommendations

A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs

We consider the maximum vertex-weighted matching problem (MVM), in which nonnegative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched vertices, and we are required to compute a matching of ...
Approximating weighted matchings in parallel

We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ε), This improves the previously best approximation ratio of (1/2 - ε) of an NC algorithm for this problem.
A linear-time approximation algorithm for weighted matchings in graphs

Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 85, Issue 4

28 February 2003

52 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 28 February 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huang SSu HOshman RNolin AHalldorsson MBalliu A(2023)(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel SettingsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594570(44-54)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594570
Brüggemann ABreuer MKlinger ASchneider TMeyer UHong YWang L(2022)Secure Maximum Weight Matching Approximation on General GraphsProceedings of the 21st Workshop on Privacy in the Electronic Society10.1145/3559613.3563209(83-87)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3559613.3563209
Angriman EBoroń MMeyerhenke H(2022)A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted MatchingACM Journal of Experimental Algorithmics10.1145/352922827(1-41)Online publication date: 7-Jul-2022
https://dl.acm.org/doi/10.1145/3529228
Peng HYang RWang ZLi JHe LYu PZomaya ARanjan R(2022)Lime: Low-Cost and Incremental Learning for Dynamic Heterogeneous Information NetworksIEEE Transactions on Computers10.1109/TC.2021.305708271:3(628-642)Online publication date: 9-Feb-2022
https://dl.acm.org/doi/10.1109/TC.2021.3057082
Huang DPettie S(2022)Approximate Generalized Matching: f-Matchings and f-Edge CoversAlgorithmica10.1007/s00453-022-00949-584:7(1952-1992)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s00453-022-00949-5
Ueno YKondo MTanaka MSuzuki YTabuchi Y(2021)QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder for Surface Code2021 58th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC18074.2021.9586326(451-456)Online publication date: 5-Dec-2021
https://dl.acm.org/doi/10.1109/DAC18074.2021.9586326
Elmeiligy MDesouky AElghamrawy S(2021)An efficient parallel indexing structure for multi-dimensional big data using sparkThe Journal of Supercomputing10.1007/s11227-021-03718-377:10(11187-11214)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s11227-021-03718-3
Michail DKinable JNaveh BSichi J(2020)JGraphT—A Java Library for Graph Data Structures and AlgorithmsACM Transactions on Mathematical Software10.1145/338144946:2(1-29)Online publication date: 19-May-2020
https://dl.acm.org/doi/10.1145/3381449
Valejo AFerreira VFabbri ROliveira MLopes A(2020)A Critical Survey of the Multilevel Method in Complex NetworksACM Computing Surveys10.1145/337934753:2(1-35)Online publication date: 17-Apr-2020
https://dl.acm.org/doi/10.1145/3379347
Holmes AJokar MPasandi GDing YPedram MChong FMartínez JDuato JEeckhout L(2020)NISQ+Proceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00053(556-569)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00053
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs

Approximating weighted matchings in parallel

A linear-time approximation algorithm for weighted matchings in graphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations