Stateless distributed algorithms for near optimal maximum multicommodity flows

DOI10.1145/1400751.1400835MaRDI QIDQ2934365zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Rohit Khandekar

Publication date 12 December 2014

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

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

zbMATH Keywords

multicommodity flowsstateless distributed algorithms

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Randomized algorithms (68W20) Deterministic network models in operations research (90B10)

Recommendations

• Greedy distributed optimization of multi-commodity flows
• 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
• Stateless Near Optimal Flow Control with Poly-logarithmic Convergence

Cited in

(7)

• 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
• Optimal multicommodity flow through the complete graph with random edge capacities
• Greedy distributed optimization of multi-commodity flows
• Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
• Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast

This page was built for publication: Stateless distributed algorithms for near optimal maximum multicommodity flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934365)