Author:
Caramia Massimiliano,Sgalambro Antonino
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005)
2. Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 15–29 (2001)
3. Badics, T.: GENRMF, ftp://dimacs.rutgers.edu/pub/netflow/generators/network/genrmf/
4. Baier, G.: Flows with path restrictions. Ph.D. Thesis, Technisce Universitat Berlin, Cuvillier Verlag Gottingen (2003)
5. Baier G., Köhler E. and Skutella M. (2005). On the k-splittable flow problem. Algorithmica 42: 231–248
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献