Near-perfect load balancing by randomized rounding
From MaRDI portal
Recommendations
Cited in
(15)- Discrete load balancing on complete bipartite graphs
- Improved analysis of deterministic load-balancing schemes
- Quasirandom load balancing
- Improved analysis of deterministic load-balancing schemes
- Randomized load balancing on networks with stochastic inputs
- Discrete load balancing is (almost) as easy as continuous load balancing
- Quasirandom load balancing
- A simple approach for adapting continuous load balancing processes to discrete settings
- A simple approach for adapting continuous load balancing processes to discrete settings
- Efficient schemes for nearest neighbor load balancing
- Local deal-agreement algorithms for load balancing in dynamic general graphs
- Distributed Averaging in Opinion Dynamics
- Dynamic load balancing by random matchings
- An analysis of load-balancing algorithms on edge-Markovian evolving graphs
- Randomized diffusion for indivisible loads
This page was built for publication: Near-perfect load balancing by randomized rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172705)