Brief Announcement: Distributed Approximations for the Semi-matching Problem

DOI10.1007/978-3-642-24100-0_18zbMath1350.68278OpenAlexW174342752MaRDI QIDQ3095327

Edyta Szymańska, Krzysztof Krzywdziński, Wojciech Wawrzyniak, Michał Hanćkowiak, Andrzej Czygrinow

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_18

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Related Items (3)

Weak models of distributed computing, with connections to modal logic ⋮ On the distributed complexity of the semi-matching problem ⋮ A local approximation algorithm for minimum dominating set problem in anonymous planar networks

Cites Work

• Faster Algorithms for Semi-matching Problems (Extended Abstract)
• Distributed 2-Approximation Algorithm for the Semi-matching Problem
• Semi-matchings for bipartite graphs and load balancing
• Unnamed Item

This page was built for publication: Brief Announcement: Distributed Approximations for the Semi-matching Problem