| Management number | 232051861 | Release Date | 2026/06/18 | List Price | $63.82 | Model Number | 232051861 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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. Read more
| ISBN10 | 013617549X |
|---|---|
| ISBN13 | 978-0136175490 |
| Edition | 1st |
| Language | English |
| Publisher | Pearson |
| Dimensions | 7.4 x 2 x 9.3 inches |
| Item Weight | 3 pounds |
| Print length | 864 pages |
| Publication date | February 18, 1993 |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form