Max concurrent flow problem

zbMATH Open1150.90507MaRDI QIDQ3501698FDOQ3501698

Dayu Zhao, Liwei Dong

Publication date: 3 June 2008

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

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)

Cited In (8)

• Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
• Title not available (Why is that?)
• An Approximation for a Continuous Max-Flow Problem
• Maximum concurrent flow with incomplete data
• Title not available (Why is that?)
• The maximum concurrent flow problem
• Efficient algorithms for the maximum concurrent flow problem
• Playing with the Maximum-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)