Distributed approximate matching

Zvi Lotker; Boaz Patt-Shamir; Adi Rosen

doi:10.1145/1281100.1281126

Distributed approximate matching

Zvi Lotker, Boaz Patt-Shamir, Adi Rosen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	PODC'07
Subtitle of host publication	Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	167-174
Number of pages	8
ISBN (Print)	1595936165, 9781595936165
DOIs	https://doi.org/10.1145/1281100.1281126
State	Published - 1 Jan 2007
Event	PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States Duration: 12 Aug 2007 → 15 Aug 2007

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
Country/Territory	United States
City	Portland, OR
Period	12/08/07 → 15/08/07

Keywords

Distributed algorithms
Distributed approximation algorithms
Dynamic algorithms
Graph algorithms
Maximum matching

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/1281100.1281126

Cite this

@inproceedings{3efad3b58856427996c945b15dc4b81c,

title = "Distributed approximate matching",

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.",

keywords = "Distributed algorithms, Distributed approximation algorithms, Dynamic algorithms, Graph algorithms, Maximum matching",

author = "Zvi Lotker and Boaz Patt-Shamir and Adi Rosen",

year = "2007",

month = jan,

day = "1",

doi = "10.1145/1281100.1281126",

language = "English",

isbn = "1595936165",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "167--174",

booktitle = "PODC'07",

note = "PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 12-08-2007 Through 15-08-2007",

}

Lotker, Z, Patt-Shamir, B & Rosen, A 2007, Distributed approximate matching. in PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 167-174, PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, United States, 12/08/07. https://doi.org/10.1145/1281100.1281126

Distributed approximate matching. / Lotker, Zvi; Patt-Shamir, Boaz; Rosen, Adi.
PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2007. p. 167-174 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed approximate matching

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Rosen, Adi

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

KW - Distributed algorithms

KW - Distributed approximation algorithms

KW - Dynamic algorithms

KW - Graph algorithms

KW - Maximum matching

UR - http://www.scopus.com/inward/record.url?scp=36849046768&partnerID=8YFLogxK

U2 - 10.1145/1281100.1281126

DO - 10.1145/1281100.1281126

M3 - Conference contribution

AN - SCOPUS:36849046768

SN - 1595936165

SN - 9781595936165

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 167

EP - 174

BT - PODC'07

PB - Association for Computing Machinery

T2 - PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 12 August 2007 through 15 August 2007

ER -

Distributed approximate matching

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this