Distributed approximate matching
From MaRDI portal
Publication:5401409
DOI10.1145/1281100.1281126zbMath1283.68399MaRDI 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
maximum matching; graph algorithms; distributed algorithms; dynamic algorithms; distributed approximation algorithms
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
68W15: Distributed algorithms
Related Items
Dynamic Approximate Vertex Cover and Maximum Matching, Distributed Graph Algorithms and their Complexity: An Introduction, Distributed algorithms for covering, packing and maximum weighted matching, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists, Improved deterministic distributed matching via rounding, Communication complexity of approximate maximum matching in the message-passing model