Distributed approximate matching
DOI10.1145/1281100.1281126zbMATH Open1283.68399OpenAlexW2029185453MaRDI QIDQ5401409FDOQ5401409
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
Recommendations
distributed algorithmsgraph algorithmsmaximum matchingdynamic algorithmsdistributed approximation algorithms
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)
Cited In (14)
- Communication complexity of approximate maximum matching in the message-passing model
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- Distributed Graph Algorithms and their Complexity: An Introduction
- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
- Distributed algorithm for approximating the maximum matching
- Efficient Distributed Weighted Matchings on Trees
- Algorithms – ESA 2004
- Distributed Weighted Matching
- Dynamic Approximate Vertex Cover and Maximum Matching
- Distributed algorithms for covering, packing and maximum weighted matching
- Improved Distributed Approximate Matching
- Improved deterministic distributed matching via rounding
This page was built for publication: Distributed approximate matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401409)
