Price: [price_with_discount]
(as of [price_update_date] – Details)
[ad_1]
A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.
presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.devotes a special chapter to conducting empirical testing of algorithms.features over 150 applications of network flows to a variety of engineering, management, and scientific domains.contains extensive reference notes and illustrations.
Publisher : Pearson; 1st edition (February 18, 1993)
Language : English
Hardcover : 864 pages
ISBN-10 : 013617549X
ISBN-13 : 978-0136175490
Item Weight : 3.35 pounds
Dimensions : 7.4 x 2 x 9.3 inches
[ad_2]
