Maximum Bipartite Flow in Networks with Adaptive Channel Width

DOI10.1007/978-3-642-02930-1_29zbMath1248.90023OpenAlexW1596640390MaRDI QIDQ3638105

Thomas Moscibroda, Aleksander Mądry, Debmalya Panigrahi, Aravind Srinivasan, Yossi Azar

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_29

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)