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 条
  • [41] Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks
    Djaker, Abou-Bakr
    Kechar, Bouabdellah
    Afifi, Hossam
    Moungla, Hassine
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2023, 48 (08) : 10079 - 10098
  • [42] Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks
    Abou-Bakr Djaker
    Bouabdellah Kechar
    Hossam Afifi
    Hassine Moungla
    Arabian Journal for Science and Engineering, 2023, 48 : 10079 - 10098
  • [43] Maximum flow based model and method of the maximum lifetime problem of sensor networks
    Pan, Yantao
    Peng, Wei
    Lu, Xicheng
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3623 - +
  • [44] The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
    Goldberg, Andrew V.
    ALGORITHMS - ESA 2008, 2008, 5193 : 466 - 477
  • [45] A Labeling Algorithm for the Maximum Flow Problem Based On Disconnected Chains
    Zhao, Li-feng
    Dong, Fang
    2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND MANAGEMENT SCIENCE (ICIEMS 2013), 2013, : 1351 - 1356
  • [46] ALGORITHM OF SOLUTION TO PROBLEM OF MAXIMUM FLOW IN NETWORK WITH POWER ESTIMATES
    DINITS, EA
    DOKLADY AKADEMII NAUK SSSR, 1970, 194 (04): : 754 - &
  • [47] A Combinatorial Algorithm for Generalized Maximum Flow Problem in Lossy Network
    Dong Liwei
    Zhang Xiaofen
    Wang Hong
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 2295 - 2300
  • [48] A specialized network simplex algorithm for the constrained maximum flow problem
    Caliskan, Cenk
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (02) : 137 - 147
  • [49] Maximum flow based model and method of the maximum lifetime problem of sensor networks
    Pan, Yan-Tao
    Peng, Wei
    Lu, Xi-Cheng
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 2006, 28 (03): : 59 - 63
  • [50] Sea Lion Optimization Algorithm for Solving the Maximum Flow Problem
    El-Omari, Nidhal Kamel Taha
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2020, 20 (08): : 30 - 68
12345