Brief announcement: Distributed approximations for the semi-matching problem
From MaRDI portal
Publication:3095327
Recommendations
- Distributed 2-approximation algorithm for the semi-matching problem
- On the distributed complexity of 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
Cites work
Cited in
(7)- On the distributed complexity of the semi-matching problem
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks
- Distributed 2-approximation algorithm for the semi-matching problem
- Tight Approximation Bounds for the Seminar Assignment Problem
- Weak models of distributed computing, with connections to modal logic
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Brief announcement: Efficient load-balancing through distributed token dropping
This page was built for publication: Brief announcement: Distributed approximations for the semi-matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095327)