College of Science, Zhongyuan University of Technology, Zhengzhou, China
College of Science, Zhongyuan University of Technology, Zhengzhou, China
College of Science, Zhongyuan University of Technology, Zhengzhou, China
Copyright © 2018 Chengwen Jiao, Qi Feng, Weichun Bu et al. This is
an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any
medium, provided the original work is properly cited.
How to Cite this Article
Jiao, C. , Feng, Q. and Bu, W. (2018) Some Complexity Results for the k-Splittable Flow Minimizing Congestion Problem.
Communications and Network,
10, 1-10. doi:
10.4236/cn.2018.101001.