Author:
Caramia Massimiliano,Sgalambro Antonino
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory Algorithms and Applications. Prentice Hall Inc., Englewood Cliffs (1993)
2. Albrecht C.: Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. Comput. Aided Des. Integr. Circuit Syst. 20, 622–632 (2001)
3. Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005)
4. 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)
5. Badics, T.: GENRMF. (1991). ftp://dimacs.rutgers.edu/pub/netflow/generators/network/genrmf/
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献