Improved distributed approximate matching

Zvi Lotker, Boaz Patt-Shamir, Seth Pettie

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

55 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationSPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures
Pages129-136
Number of pages8
DOIs
StatePublished - 15 Dec 2008
Event20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08 - Munich, Germany
Duration: 14 Jun 200816 Jun 2008

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08
Country/TerritoryGermany
CityMunich
Period14/06/0816/06/08

Keywords

  • Matching

Fingerprint

Dive into the research topics of 'Improved distributed approximate matching'. Together they form a unique fingerprint.

Cite this