Abstract
We present a distributed approximation algorithm that computes in every graph G a matching M of size at least \(\frac 23 \beta(G),\) where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4|V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].
Research supported by KBN grant no. 7 T11C 032 20
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computing. In: Proc. of the 30th Symposium on Foundations of Computer Science (FOCS 1989), pp. 364–369 (1989)
Czygrinow, A., Hańćkowiak, M., Szymańska, E.: Distributed algorithm for approximating the maximum matching. Discrete Applied Math. published online (March 19, 2004)
Fischer, T., Goldberg, A.V., Haglin, D.J., Plotkin, S.: Approximating matchings in parallel. Information Processing Letters 46, 115–118 (1993)
Hańćkowiak, M., Karoński, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math. 15(1), 41–57 (2001)
Lovász, L., Plummer, M.: Matching Theory. Elsevier, Amsterdam (1986)
Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193–201 (1992)
Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. on Computing 15(4), 254–278 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czygrinow, A., Hańćkowiak, M., Szymańska, E. (2004). A Fast Distributed Algorithm for Approximating the Maximum Matching. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive