Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

DOI10.1145/2390176.2390179zbMath1301.68249OpenAlexW2100001654MaRDI QIDQ2933631

Baruch Awerbuch, Rohit Khandekar, Satish B. Rao

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

steepest descentdistributed algorithmsmulticommodity flowmultiplicative update

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence ⋮ Near-Optimal Distributed Maximum Flow

This page was built for publication: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework