Greedy distributed optimization of multi-commodity flows

DOI10.1145/1281100.1281140zbMATH Open1283.68075OpenAlexW1996780166MaRDI QIDQ5401422FDOQ5401422

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

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

zbMATH Keywords

distributed algorithmsself-stabilizationmulti-commodity flowsstatelessness

Mathematics Subject Classification ID

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

Cited In (14)

• Using agents for solving a multi-commodity-flow problem
• The Multi-Commodity Source Location Problems and the Price of Greed
• Flow and greedy algorithms of resource co-allocation in distributed systems
• Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
• From the physics of interacting polymers to optimizing routes on the London underground
• 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
• Distributed network monitoring and multicommodity flows, a primal-dual approach
• Approximating Wardrop equilibria with finitely many agents
• Termination of amnesiac flooding
• Title not available (Why is that?)
• Greedy distributed optimization of multi-commodity flows
• 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)