Optimal Capacity Expansion Arc Algorithm on Networks

• Published in: Computational and Information Science pp. 105 - 110
• Main Authors: Liu, Yuhua, Yu, Shengsheng, Mao, Jingzhong, Yang, Peng
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 01.01.2004; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Applied sciences; Capacity Expansion; Capacity Network; Exact sciences and technology; Feasible Flow; Finite Step; Maximum Flow; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Algorithm theory; Bottleneck; Network topology; Network flow; Optimal algorithm; Algorithm complexity
• ISBN: 9783540241270; 3540241272
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-30497-5_17

The problem of the capacity expansion of a network by means of expanding the capacity of its arcs is elaborated in this paper. By using the theory and algorithm of the maximum flow, the minimum cut-set and the bottleneck of the network can be found, then the expansible arcs are sought according to whether there exists any augmenting path in the minimum cut-set. If the expansible arcs exist,the capacity of the network can be expanded by means of expanding the capacity of those arcs to increase the maximum flow. In order to fulfill the goal, the algorithms of the expansible arc and the optimal expansion arc are presented and the complexity analyses of those algorithms are given as well.