Distributed 2-Approximation Algorithm for the Semi-matching Problem

DOI10.1007/978-3-642-33651-5_15zbMath1377.68314OpenAlexW175379075MaRDI QIDQ4909413

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

Publication date: 13 March 2013

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-33651-5_15

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (8)

On computing an optimal semi-matching ⋮ Solving the at-most-once problem with nearly optimal effectiveness ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ Distributed backup placement in networks ⋮ On the distributed complexity of the semi-matching problem ⋮ A local approximation algorithm for minimum dominating set problem in anonymous planar networks ⋮ Brief Announcement: Distributed Approximations for the Semi-matching Problem ⋮ Distributed backup placement

This page was built for publication: Distributed 2-Approximation Algorithm for the Semi-matching Problem