Distributed Weighted Matching
From MaRDI portal
Publication:5464202
DOI10.1007/978-3-540-30186-8_24zbMath1110.68547OpenAlexW1523785148MaRDI QIDQ5464202
Mirjam Wattenhofer, Roger Wattenhofer
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-30186-8_24
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (19)
Proof labeling schemes ⋮ Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Matching numbers in fuzzy graphs ⋮ Distributed algorithms for weighted problems in sparse graphs ⋮ Improved deterministic distributed matching via rounding ⋮ (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings ⋮ Multi-agent reinforcement learning for decentralized stable matching ⋮ Almost stable matchings by truncating the Gale-Shapley algorithm ⋮ 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 ⋮ Constant-time local computation algorithms ⋮ A simple local 3-approximation algorithm for vertex cover ⋮ A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 ⋮ Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs ⋮ On the Microscopic View of Time and Messages ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Distributed Approximate Maximum Matching in the CONGEST Model.
This page was built for publication: Distributed Weighted Matching
