Publisher
Springer Berlin Heidelberg
Reference56 articles.
1. Aggarwal, C., Orlin, J.: On multi-route maximum flows in networks. Networks 39, 43–52 (2002)
2. Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204–1216 (2000)
3. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
4. Anshelevich, E., Zhang, L.: Path decomposition under a new cost measure with applications to optical network design. In: European Symposium on Algorithms (ESA), pp. 28–39 (2004)
5. Bartholdi, J.J., Orlin, J.B., Ratliff, H.D.: Cyclic scheduling via integer programs with circular ones. Oper. Res. 28, 1074–1085 (1980)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Improved Upper Bound for the Ring Loading Problem;SIAM Journal on Discrete Mathematics;2022-04-07
2. Rerouting Flows when Links Fail;SIAM Journal on Discrete Mathematics;2020-01
3. An Improved Upper Bound for the Ring Loading Problem;Approximation and Online Algorithms;2020
4. The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems;Theory of Computing;2017
5. Maximum Flows on Disjoint Paths;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2010