Network Flow Algorithms

Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.

David P. Williamson (Author)

9781316636831, Cambridge University Press

Paperback / softback, published 5 September 2019

326 pages, 52 b/w illus.
22.7 x 15.2 x 1.9 cm, 0.48 kg

'The book includes many lemmas and theorems with proofs. It provides a succinct, amalgamated view of a broad mixture of effective combinatorial algorithms for network flow problems, including many topics not found in other textbooks … I strongly recommend the book for students and researchers.' S. V. Nagaraj, SIGACT News

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.

1. Preliminaries: shortest path algorithms
2. Maximum flow algorithms
3. Global minimum cut algorithms
4. More maximum flow algorithms
5. Minimum-cost circulation algorithms
6. Generalized flow algorithms
7. Multicommodity flow algorithms
8. Electrical flow algorithms
9. Open questions.

Subject Areas: Computer networking & communications [UT], Algorithms & data structures [UMB], Optimization [PBU], Risk assessment [GPQD]