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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

BooksRun helps to save money on textbooks. We are committed to providing each customer with the highest standard of customer service. Please pay close attention to the description of the book and its condition you are ordering. If you have any questions or issues, please make sure to contact us first so we could resolve them. All orders are shipped on the same or the next business day. It usually takes 1 to 5 business days to receive your item if you choose expedited shipping. All orders submitted are eligible for a return within 30 days after the delivery. Thanks for shopping with us!

Visita la pagina della libreria