Author： Dong Liwei Wang Hong Zhang Xiaofen
Publisher： Inderscience Publishers
ISSN： 1741-539X
Source： International Journal of Services Operations and Informatics, Vol.5, Iss.1, 2010-01, pp. : 20-35
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Access to resources
Recommend
