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 条
  • [1] Faster Approximation Algorithm for Generalized Maximum Concurrent Flow Problem with Budget Constraint
    Dong, Liwei
    Bian, Liying
    Tang, Henyong
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1186 - +
  • [2] Approximation Algorithm for Extended Maximum Concurrent Flow Problem with Saturated Capacity
    Cheng, Congdian
    Ma, Jingxin
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGISTICS, ENGINEERING, MANAGEMENT AND COMPUTER SCIENCE (LEMCS 2015), 2015, 117 : 506 - 510
  • [3] A faster polynomial algorithm for the constrained maximum flow problem
    Caliskan, Cenk
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2634 - 2641
  • [4] THE MAXIMUM CONCURRENT FLOW PROBLEM
    SHAHROKHI, F
    MATULA, DW
    JOURNAL OF THE ACM, 1990, 37 (02) : 318 - 334
  • [5] A combinatorial approximation algorithm for concurrent flow problem and its application
    Chiou, SW
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (04) : 1007 - 1035
  • [6] A FASTER DETERMINISTIC MAXIMUM FLOW ALGORITHM
    KING, V
    RAO, S
    TARJAN, R
    JOURNAL OF ALGORITHMS, 1994, 17 (03) : 447 - 474
  • [7] A faster and flexible algorithm for a location problem on undirected flow networks
    Ito, H
    Uehara, H
    Yokoyama, M
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04): : 704 - 712
  • [8] Faster and flexible algorithm for a location problem on undirected flow networks
    Ito, Hiro
    Uehara, Hideyuki
    Yokoyama, Mitsuo
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2000, E83-A (04) : 704 - 712
  • [9] An Improved Flow Deviation Method for the Maximum Concurrent Flow Problem
    Chen, Yanxiang
    Zhang, Yu
    Yuan, Mengze
    PROCEEDINGS OF 2020 IEEE 4TH INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2020), 2020, : 1179 - 1182
  • [10] Efficient Algorithms for the Maximum Concurrent Flow Problem
    Bauguion, Pierre-Olivier
    Ben-Ameur, Walid
    Gourdin, Eric
    NETWORKS, 2015, 65 (01) : 56 - 67
12345