Distributed approximate matching

DOI10.1145/1281100.1281126zbMath1283.68399OpenAlexW2029185453MaRDI QIDQ5401409

Zvi Lotker, Adi Rosén, Boaz Patt-Shamir

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281126

zbMATH Keywords

maximum matchinggraph algorithmsdistributed algorithmsdynamic algorithmsdistributed approximation algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (7)

Improved deterministic distributed matching via rounding ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ Dynamic Approximate Vertex Cover and Maximum Matching

This page was built for publication: Distributed approximate matching