TY - GEN
T1 - Improved distributed approximate matching
AU - Lotker, Zvi
AU - Patt-Shamir, Boaz
AU - Pettie, Seth
PY - 2008/12/15
Y1 - 2008/12/15
N2 - We present improved algorithms for finding approximately optimal matchings in both weighted and unweighted graphs. For unweighted graphs, we give an algorithm providing (1 - ε)-approximation in O(log n) time for any constant ε > 0. This result improves on the classical 1/2-approximation due to Israeli and Itai. As a by-product, we also provide an improved algorithm for unweighted matchings in bipartite graphs. In the context of weighted graphs, we give another algorithm which provides (1/2 - ε) approximation in general graphs in O(log n) time. The latter result improves on the known (1/4 - ε)-approximation in O(log n) time.
AB - We present improved algorithms for finding approximately optimal matchings in both weighted and unweighted graphs. For unweighted graphs, we give an algorithm providing (1 - ε)-approximation in O(log n) time for any constant ε > 0. This result improves on the classical 1/2-approximation due to Israeli and Itai. As a by-product, we also provide an improved algorithm for unweighted matchings in bipartite graphs. In the context of weighted graphs, we give another algorithm which provides (1/2 - ε) approximation in general graphs in O(log n) time. The latter result improves on the known (1/4 - ε)-approximation in O(log n) time.
KW - Matching
UR - http://www.scopus.com/inward/record.url?scp=57349181420&partnerID=8YFLogxK
U2 - 10.1145/1378533.1378558
DO - 10.1145/1378533.1378558
M3 - Conference contribution
AN - SCOPUS:57349181420
SN - 9781595939739
T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures
SP - 129
EP - 136
BT - SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures
T2 - 20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08
Y2 - 14 June 2008 through 16 June 2008
ER -