Abstract
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − ε times the maximum for any given constant ε > 0. The second one is an NC approximation algorithm achieving an approximation ratio of\( \frac{1} {{2 + \varepsilon }} \) for any fixed ε > 0. The third and fourth algorithms only need to know the total order of weights, so they are useful when the edge weights require a large amount of memories to represent. The third one is an NC approximation algorithm that finds a matching of weight at least \( \frac{2} {{3\Delta + 2}} \) times the maximum, where Δ is the maximum degree of the graph. The fourth one is an RNC algorithm that finds a matching of weight at least \( \frac{1} {{2\Delta + 4}} \) times the maximum on average, and runs in Ο(logΔ) time, not depending on the size of the graph.
Chapter PDF
Similar content being viewed by others
References
D. Avis. A Survey of Heuristics for the Weighted Matching Problem. Networks, 13:475–493, 1983.
J. Edmonds. Paths, Trees and Flowers. Canad. J. Math., 17:449–467, 1965.
T. Fischer, A.V. Goldberg, D.J. Haglin, and S. Plotkin. Approximating matchings in parallel. Information Processing Letters, 46:115–118, 1993.
H.N. Gabow. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 434–443. ACM, 1990.
Z. Galil. Efficient Algorithms for Finding Maximum Matching in Graphs. Computing Surveys, 18(1):23–38, 1986.
R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computation.. Oxford University Press, 1995.
F. Harary. Graph Theory. Addison-Wesley, 1972.
A. Israeli and Y. Shiloach. An Improved Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:57–60, 1986.
D.S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, editor, The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity, pages 69–161. Elsevier, 1990.
R.M. Karp and V. Ramachandran. Parallel Algorithms for Shared-Memory Machines. In J. van Leeuwen, editor, The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity, pages 870–941. Elsevier, 1990.
M. Karpinski and W. Rytter. Fast Parallel Algorithms for Graph Matching Problems. Clarendon Press, 1998.
R.M. Karp, E. Upfal, and A. Wigderson. Constructing a Perfect Matching is in Random NCCombinatorica, 6(1):35–48, 1986.
E.W. Mayr and A. Subramanian. The Complexity of Circuit Value and Network Stability. Journal of Computer and System Science, 44:302–323, 1992.
R. Preis. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. In STACS’ 99, pages 259–269. Lecture Notes in Computer Science Vol. 1563, Springer-Verlag, 1999.
S.M. Venkatesan. Approximation Algorithms for Weighted Matching. Theoretical Computer Science, 54:129–137, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uehara, R., Chen, Z.Z. (2000). Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive