Approximation Algorithms for the Maximum Concurrent Flow Problem

DOI10.1287/ijoc.1.2.62zbMath0753.90030OpenAlexW2159872727MaRDI QIDQ4019972

Farhad Shahrokhi

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1.2.62

zbMATH Keywords

multicommodity flowsmaximum concurrent flow problemfully polynomial \(\varepsilon\)-approximate algorithmlinear size reduction

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

On Canonical Concurrent Flows, Crossing Number and Graph Expansion ⋮ An exponential‐function reduction method for block‐angular convex programs

This page was built for publication: Approximation Algorithms for the Maximum Concurrent Flow Problem