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

被引：0

作者：

Dong L. ^{[1
]}

Wang H. ^{[1
]}

Zhang X. ^{[1
]}

机构：

[1] Department of Software, Shenyang Normal University, Shenyang

来源：

International Journal of Services Operations and Informatics | 2010年 / 5卷 / 01期

关键词：

Flow-generating cycles; Fully polynomial approximation algorithm; Generalised maximum concurrent flow; Generalised shortest paths; Lossy networks;

D O I：

10.1504/IJSOI.2010.031046

中图分类号：

学科分类号：

摘要：

This paper presents fully polynomial approximation algorithm for generalised maximum concurrent flow problem in networks with no flowgenerating 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. Copyright © 2010 Inderscience Enterprises Ltd.

引用

页码：20 / 35

页数：15

共 50 条

[31] The pseudoflow algorithm: A new algorithm for the maximum-flow problem
Hochbaum, Dorit S.
OPERATIONS RESEARCH, 2008, 56 (04) : 992 - 1009
[32] On a Capacity Scaling Algorithm for the Constrained Maximum Flow Problem
Caliskan, Cenk
NETWORKS, 2009, 53 (03) : 229 - 230
[33] A self-stabilizing algorithm for the maximum flow problem
Sukumar Ghosh
Arobinda Gupta
Sriram V. Pemmaraju
Distributed Computing, 1997, 10 : 167 - 180
[34] A CAPACITY SCALING ALGORITHM FOR THE CONSTRAINED MAXIMUM FLOW PROBLEM
AHUJA, RK
ORLIN, JB
NETWORKS, 1995, 25 (02) : 89 - 98
[35] Models and Algorithm of Maximum Flow Problem in Uncertain Network
Zhou, Chen
Peng, Jin
ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, PT I, 2011, 7002 : 101 - +
[36] A double scaling algorithm for the constrained maximum flow problem
Caliskan, Cenk
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1138 - 1150
[37] THEORETICAL EFFICIENCY OF THE ALGORITHM CAPACITY FOR THE MAXIMUM FLOW PROBLEM
QUEYRANNE, M
MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (02) : 258 - 266
[38] A self-stabilizing algorithm for the maximum flow problem
Ghosh, S
Gupta, A
Pemmaraju, SV
DISTRIBUTED COMPUTING, 1997, 10 (04) : 167 - 180
[39] An exact approach for the maximum concurrent k-splittable flow problem
Massimiliano Caramia
Antonino Sgalambro
Optimization Letters, 2008, 2 : 251 - 265
[40] An exact approach for the maximum concurrent k-splittable flow problem
Caramia, Massimiliano
Sgalambro, Antonino
OPTIMIZATION LETTERS, 2008, 2 (02) : 251 - 265

← 1 2 3 4 5 →