Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.

作者： Henning Bruhn , Jakub Cerny , Alexander Hall , Petr Kolman , Jiri Sgall

关键词:

摘要:

参考文章(32)

Donglei Du, R. Chandrasekaran, Multiroute flow problem The University of Texas at Dallas. ,(2003)

Karl Menger, Zur allgemeinen Kurventheorie Fundamenta Mathematicae. ,vol. 10, pp. 96- 115 ,(1927) , 10.4064/FM-10-1-96-115

Ronald Koch, Martin Skutella, Ines Spenke, Approximation and complexity of k –splittable flows workshop on approximation and online algorithms. pp. 244- 257 ,(2005) , 10.1007/11671411_19

Maren Martens, Martin Skutella, Length-Bounded and Dynamic k-Splittable Flows A Quarterly Journal of Operations Research. pp. 297- 302 ,(2006) , 10.1007/3-540-32539-5_47

Donglei Du, R. Chandrasekaran, The multiroute maximum flow problem revisited Networks. ,vol. 47, pp. 81- 92 ,(2006) , 10.1002/NET.V47:2

Alok Baveja, Aravind Srinivasan, Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems Mathematics of Operations Research. ,vol. 25, pp. 255- 280 ,(2000) , 10.1287/MOOR.25.2.255.12228

James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)

Petr Kolman, Christian Scheideler, Simple On-Line Algorithms for the Maximum Disjoint Paths Problem Algorithmica. ,vol. 39, pp. 209- 233 ,(2004) , 10.1007/S00453-004-1086-1

Stavros G. Kolliopoulos, Clifford Stein, Approximation Algorithms for Single-Source Unsplittable Flow SIAM Journal on Computing. ,vol. 31, pp. 919- 946 ,(2002) , 10.1137/S0097539799355314

Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman, Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks SIAM Journal on Discrete Mathematics. ,vol. 21, pp. 141- 157 ,(2007) , 10.1137/S0895480102419743