Distributed 2-approximation algorithm for the semi-matching problem
From MaRDI portal
Publication:4909413
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Distributed algorithms (68W15) Distributed systems (68M14)
Recommendations
- On the distributed complexity of the semi-matching problem
- Brief announcement: Distributed approximations for the semi-matching problem
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Theory and Applications of Models of Computation
- Semi-matchings for bipartite graphs and load balancing
Cited in
(11)- Solving the at-most-once problem with nearly optimal effectiveness
- Brief announcement: Distributed approximations for the semi-matching problem
- Distributed backup placement
- 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
- Theory and Applications of Models of Computation
- Improved bounds for distributed load balancing
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Brief announcement: Efficient load-balancing through distributed token dropping
- On computing an optimal semi-matching
This page was built for publication: Distributed 2-approximation algorithm for the semi-matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909413)
