论文信息 - Distributed weighted matching

Distributed weighted matching

In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time complexity of O(log2 n).

Roger Wattenhofer | Mirjam Wattenhofer

[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[2] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[3] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[4] Alon Itai,et al. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[5] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .

[6] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[7] Samir Khuller,et al. A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers , 1994, J. Algorithms.

[8] Alessandro Panconesi,et al. On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[9] Zhi-Zhong Chen,et al. Parallel approximation algorithms for maximum weighted matching in general graphs , 2000, Inf. Process. Lett..

[10] Lisa Higham,et al. Dynamic and self-stabilizing distributed matching , 2002, PODC '02.

[11] R. Rajaraman,et al. An efficient distributed algorithm for constructing small dominating sets , 2002 .

[12] Roger Wattenhofer,et al. Constant Time Distributed Dominating Set Approximation , 2022 .

[13] Roger Wattenhofer,et al. Lower and Upper Bounds for Distributed Packing and Covering , 2004 .