Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
From MaRDI portal
Publication:2934686
Recommendations
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Greedy distributed optimization of multi-commodity flows
- Greedy distributed optimization of multi-commodity flows
- Stateless distributed algorithms for near optimal maximum multicommodity flows
- Fast approximation algorithms for multicommodity flow problems
Cited in
(13)- Efficient primal-dual graph algorithms for MapReduce
- Greedy distributed optimization of multi-commodity flows
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
- Load balancing without regret in the bulletin board model
- Stateless distributed algorithms for near optimal maximum multicommodity flows
- Distributed network monitoring and multicommodity flows, a primal-dual approach
- Management of Variable Data Streams in Networks
- Approximating Wardrop equilibria with finitely many agents
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
- scientific article; zbMATH DE number 1149401 (Why is no real title available?)
- Greedy distributed optimization of multi-commodity flows
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
This page was built for publication: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934686)
