Fast deterministic approximation for the multicommodity flow problem
From MaRDI portal
Publication:1373725
DOI10.1016/S0025-5610(96)00072-XzbMath0893.90057OpenAlexW4229874502MaRDI QIDQ1373725
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0025-5610(96)00072-x
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (7)
A combinatorial approximation algorithm for supply chain network flow problem ⋮ Unnamed Item ⋮ A fast polynomial time algorithm for logistics network flows ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ A combinatorial approximation algorithm for concurrent flow problem and its application ⋮ Multicast Routing and Design of Sparse Connectors
This page was built for publication: Fast deterministic approximation for the multicommodity flow problem
