### Improved Distributed Approximate MatchingImproved Distributed Approximate Matching

Access Restriction
Subscribed

 Author Lotker, Zvi ♦ Patt-Shamir, Boaz ♦ Pettie, Seth Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2015 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword CONGEST model ♦ Network algorithms Abstract We present distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times. The computational model is a network of processors exchanging $\textit{O}(log$ $\textit{n})-bit$ messages (the CONGEST model). For unweighted graphs, we give an algorithm providing (1-ε)-approximation in $\textit{O}(log$ $\textit{n})$ time for any constant ε>0, improving on the classical ½-approximation in $\textit{O}log$ $\textit{n})$ time of Israeli and Itai [1986]. The time complexity of the algorithm depends on 1⁃ε exponentially in the general case, and polynomially in bipartite graphs. For weighted graphs, we present another algorithm which provides (½-ε) approximation in general graphs in $O(logε^{-1}log$ $\textit{n})$ time, improving on the previously known algorithms which attain (¼-ε)-approximation in $\textit{O}(log$ $\textit{n})$ time or ½-approximation in $\textit{O}(\textit{n})$ time. All our algorithms are randomized: the complexity bounds hold both with high probability and for the expected running time. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2015-11-02 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 62 Issue Number 5 Page Count 17 Starting Page 1 Ending Page 17

#### Open content in new tab

Source: ACM Digital Library