634,94 €
705,49 €
-10% with code: EXTRA
Network Flows
634,94 € 
- We will send in 10–14 business days.
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…
/images/books/2846050/9780136175490.jpg)
- Author: Ravindra Ahuja
- Publisher: Pearson
- ISBN-10: 013617549X
- ISBN-13: 9780136175490
- Format: 18.6 x 24.4 x 4.8 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
- 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.
EXTRA 10 % discount with code: EXTRA
634,94 €
705,49 €
We will send in 10–14 business days.
The promotion ends in 18d.15:33:06
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Ravindra Ahuja
- Publisher: Pearson
- ISBN-10: 013617549X
- ISBN-13: 9780136175490
- Format: 18.6 x 24.4 x 4.8 cm, hardcover
- Language: English English
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.
- 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.
Reviews