Max concurrent flow problem

MaRDI QIDQ3501698zbMATH OpenFDO

Authors Liwei Dong, Dayu Zhao

Publication date 3 June 2008

zbMATH Keywords

fully polynomial approximation schemescomplexity of algorithmmax concurrent flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Faster approximation schemes for fractional multicommodity flow problems
• The maximum concurrent flow problem
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

Cited in

(8)

• Efficient algorithms for the maximum concurrent flow problem
• Maximum concurrent flow with incomplete data
• An Approximation for a Continuous Max-Flow Problem
• scientific article; zbMATH DE number 6863577 (Why is no real title available?)
• scientific article; zbMATH DE number 3848938 (Why is no real title available?)
• The maximum concurrent flow problem
• Playing with the Maximum-Flow Problem
• Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

This page was built for publication: Max concurrent flow problem

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