Maximum Bipartite Flow in Networks with Adaptive Channel Width

DOI10.1007/978-3-642-02930-1_29MaRDI QIDQ3638105zbMATH OpenOpenAlexFDO

Authors Aleksander Mądry, Thomas Moscibroda, 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

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

Recommendations

• Maximum bipartite flow in networks with adaptive channel width
• Maximum flows in bipartite dynamic networks
• The maximum flow in dynamic networks
• The maximum flows in bipartite dynamic networks. The static approach
• Maximum flows in parametric dynamic networks with lower bounds
• Wave algorithm for maximum flow in bipartite networks
• Maximum flows in probabilistic networks
• On the Maximum Expected Flow in a Network
• Maximum network flows with concave gains
• Maximum flows in planar dynamic networks with lower bounds

Cited in

(1)

• Maximum bipartite flow in networks with adaptive channel width

This page was built for publication: Maximum Bipartite Flow in Networks with Adaptive Channel Width

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