
网络流算法
|
231
网络流算法
算,但它不断被证明在实践中是非常高效的。我们并不推荐读者自己去实现单纯形算法,
因为它不但实现起来较为复杂,而且已经有商业软件库能够帮助完成这项工作了。
8.10 参考文献
Ahuja, R. K., T. Magnanti, and J. Orlin,
Network Flows: Theory, Algorithms, and
Applications
. Prentice Hall, 1993.
Bazaraa, M., J. Jarvis, and H. Sherali,
Linear Programming and Network Flows
. Fourth
Edition. Wiley, 2009.
Cormen, T. H., C. Leiserson, R. Rivest, and C. Stein,
Introduction to Algorithms
. Third
Edition. MIT Press, 2009.
Ford, L. R. Jr. and D. Fulkerson,
Flows in Networks
. Princeton University Press, 2010.
Fragouli, C. and T. Tabet,
“
On conditions for constant throughput in wireless net-
works,
”
ACM Transactions on Sensor Networks ...