Faster approximation algorithm for generalised maximum concurrent flow problem in networks with no flow-generating cycles

Faster approximation algorithm for generalised maximum concurrent flow problem in networks with no flow-generating cycles

0.00 Avg rating0 Votes
Article ID: iaor2010391
Volume: 5
Issue: 1
Start Page Number: 20
End Page Number: 35
Publication Date: Jan 2010
Journal: International Journal of Services Operations and Informatics
Authors: , ,
Abstract:

This paper presents fully polynomial approximation algorithm for generalised maximum concurrent flow problem in networks with no flow-generating cycles. This paper is showed by modifying the algorithms by Fleischer and Dong. For all commodities which have a common source the new algorithm calls subroutine to find their generalised shortest paths only one time, so the running time is independent of the number of commodities k. At the same time the new algorithm applies to not only to the lossy networks but also to the networks with no flow-generating cycles.

Reviews

Required fields are marked *. Your email address will not be published.