Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Services Operations and Informatics Inderscience Publishers

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

Loading next page...
 
/lp/inderscience-publishers/faster-approximation-algorithm-for-generalised-maximum-concurrent-flow-aHPE1TZdIe
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1741-539X
eISSN
1741-5403
DOI
10.1504/IJSOI.2010.031046
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Services Operations and InformaticsInderscience Publishers

Published: Jan 1, 2010

There are no references for this article.