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 条
  • [21] FASTER APPROXIMATION ALGORITHMS FOR THE UNIT CAPACITY CONCURRENT FLOW PROBLEM WITH APPLICATIONS TO ROUTING AND FINDING SPARSE CUTS
    KLEIN, P
    PLOTKIN, S
    STEIN, C
    TARDOS, E
    SIAM JOURNAL ON COMPUTING, 1994, 23 (03) : 466 - 487
  • [22] ON THE MAXIMUM CAPACITY AUGMENTATION ALGORITHM FOR THE MAXIMUM FLOW PROBLEM
    GOLDFARB, D
    HAO, JX
    DISCRETE APPLIED MATHEMATICS, 1993, 47 (01) : 9 - 16
  • [23] NEW ALGORITHM OF THE SOLUTION OF THE PROBLEM OF THE MAXIMUM FLOW
    Korznikov, A. D.
    SCIENCE & TECHNIQUE, 2013, (05): : 70 - 75
  • [24] A FAST AND SIMPLE ALGORITHM FOR THE MAXIMUM FLOW PROBLEM
    AHUJA, RK
    ORLIN, JB
    OPERATIONS RESEARCH, 1989, 37 (05) : 748 - 759
  • [25] A combinatorial approximation algorithm for the multicommodity flow problem
    Coudert, D
    Rivano, H
    Roche, X
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 256 - 259
  • [26] Approximation Algorithm for A Bicriteria Multicommodity Flow Problem
    Cheng, Congdian
    Tang, Henyong
    Zhao, Chuanli
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1756 - 1760
  • [27] Maximum flow algorithm in small capacity networks
    Zhang, X.C.
    Chen, G.L.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2001, 38 (02):
  • [28] A Compact Linear Programming Formulation of the Maximum Concurrent Flow Problem
    Dong, Yuanyuan
    Olinick, Eli V.
    Kratz, T. Jason
    Matula, David W.
    NETWORKS, 2015, 65 (01) : 68 - 87
  • [29] Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
    Christiano, Paul
    Kelner, Jonathan A.
    Madry, Aleksander
    Spielman, Daniel A.
    Teng, Shang-Hua
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 273 - 281
  • [30] NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM
    NAKAYAMA, A
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1991, 34 (01) : 13 - 27
12345