Distributed 2-approximation algorithm for the semi-matching problem
From MaRDI portal
Publication:4909413
Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Approximation algorithms (68W25) Analysis of algorithms (68W40)
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
(12)- Distributed backup placement in networks
- Distributed backup placement
- On computing an optimal semi-matching
- Brief announcement: Distributed approximations for the semi-matching problem
- Solving the at-most-once problem with nearly optimal effectiveness
- Theory and Applications of Models of Computation
- Improved bounds for distributed load balancing
- Brief announcement: Efficient load-balancing through distributed token dropping
- Distributed load balancing: a new framework and improved guarantees
- On the distributed complexity of the semi-matching problem
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
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)
