Distributed approximate matching

Zvi Lotker, Boaz Patt-Shamir, Adi Rosen

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

21 Scopus citations

Abstract

We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + )-approximation distributed algorithm for weighted maximum matching, whose running time is O(log n) for any constant > 0, where n is the number of nodes in the graph. In addition, we consider the dynamic case, where nodes are inserted and deleted one at a time. For unweighted dynamic graphs, we give an algorithm that maintains a (1 + )-approximation in O(1/) time for each node insertion or deletion. For weighted dynamic graphs we give a constant-factor approximation algorithm that runs in constant time for each insertion or deletion.

Original languageEnglish
Title of host publicationPODC'07
Subtitle of host publicationProceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages167-174
Number of pages8
ISBN (Print)1595936165, 9781595936165
DOIs
StatePublished - 1 Jan 2007
EventPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States
Duration: 12 Aug 200715 Aug 2007

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferencePODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
Country/TerritoryUnited States
CityPortland, OR
Period12/08/0715/08/07

Keywords

  • Distributed algorithms
  • Distributed approximation algorithms
  • Dynamic algorithms
  • Graph algorithms
  • Maximum matching

Fingerprint

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

Cite this