Network Flows: Theory, Algorithms, and Applications by Ravindra K. Ahuja
BUY IT NEW
- $156.00 List price$149.76 Online price$134.78 Member price(Save 13%)Limited Time Offer! Everyone receives the Member Price on books.
See Details
Reserve it at BN.com & pick it up in 60 minutes at your local store.
Enter a zip code
Textbook (Hardcover - New Edition)
- 846pp
- Sales Rank: 519,973
Textbook Information
- ISBN-13: 9780136175490
- Edition Description: New Edition
- Edition Number: 1
- Pub. Date: February 1993
- Publisher: Prentice Hall
Buy it Used: 19 copies from $69.95 See All Available
Customers who bought this also bought
Product Details
- Pub. Date: February 1993
- Publisher: Prentice Hall
- Format: Textbook Hardcover, 846pp
- Sales Rank: 519,973
- ISBN-13: 9780136175490
- ISBN: 013617549X
- Edition Number: 1
- Edition Description: New Edition
Synopsis
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.
More Reviews and Recommendations
loading...