Greedy distributed optimization of multi-commodity flows

DOI10.1145/1281100.1281140MaRDI QIDQ5401422zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Rohit Khandekar

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281140

zbMATH Keywords

distributed algorithmsmulti-commodity flowsself-stabilizationstatelessness

Mathematics Subject Classification ID

Internet topics (68M11) Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Approximation algorithms (68W25) Combinatorial optimization (90C27)

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)

• Flow and greedy algorithms of resource co-allocation in distributed systems
• Greedy distributed optimization of multi-commodity flows
• Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Stateless distributed algorithms for near optimal maximum multicommodity flows
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Approximating Wardrop equilibria with finitely many agents
• The Multi-Commodity Source Location Problems and the Price of Greed
• scientific article; zbMATH DE number 1149401 (Why is no real title available?)
• Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
• From the physics of interacting polymers to optimizing routes on the London underground
• Distributed network monitoring and multicommodity flows, a primal-dual approach
• Termination of amnesiac flooding
• Using agents for solving a multi-commodity-flow problem

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)