Greedy distributed optimization of multi-commodity flows
From MaRDI portal
Publication:5401422
Recommendations
- Greedy distributed optimization of multi-commodity flows
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Distributed network monitoring and multicommodity flows, a primal-dual approach
- Stateless distributed algorithms for near optimal maximum multicommodity flows
Cited in
(14)- From the physics of interacting polymers to optimizing routes on the London underground
- Flow and greedy algorithms of resource co-allocation in distributed systems
- scientific article; zbMATH DE number 1149401 (Why is no real title available?)
- Using agents for solving a multi-commodity-flow problem
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
- Distributed network monitoring and multicommodity flows, a primal-dual approach
- Approximating Wardrop equilibria with finitely many agents
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
- Stateless distributed algorithms for near optimal maximum multicommodity flows
- Greedy distributed optimization of multi-commodity flows
- Termination of amnesiac flooding
- The Multi-Commodity Source Location Problems and the Price of Greed
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
This page was built for publication: Greedy distributed optimization of multi-commodity flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401422)