Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Siek, J., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA (2002)
2. Allalouf, M., Shavitt, Y.: Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation. IEEE/ACM Trans. Netw. 16(5), 1015–1024 (2008). https://doi.org/10.1109/TNET.2007.905605
3. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM (2009). https://doi.org/10.1145/1502793.1502794
4. Bauguion, P.O., Ben-Ameur, W., Gourdin, E.: Efficient algorithms for the maximum concurrent flow problem. Networks 65(1), 56–67 (2015). https://doi.org/10.1002/net.21572
5. Bienstock, D., Raskina, O.: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. 91, 2002 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献