Greedy distributed optimization of multi-commodity flows

DOI10.1145/1281100.1281140zbMath1283.68075OpenAlexW1996780166MaRDI QIDQ5401422

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 algorithmsself-stabilizationmulti-commodity flowsstatelessness

Mathematics Subject Classification ID

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

Related Items

Approximating Wardrop equilibria with finitely many agents, Termination of amnesiac flooding, From the physics of interacting polymers to optimizing routes on the London Underground