TY  - BOOK
AU  - Williamson, David P
TI  - Network flow algorithms
SN  - 9781316636831
U1  - 003 
PY  - 2019///
CY  - Cambridge
PB  - Cambridge University Press
KW  - Network flow problems
KW  - Algorithms for generalized flow problems
KW  - Multicommodity flows
KW  - Algorithms for finding global minimum cuts
N1  - Includes bibliographical references (p. 294-306) and index
N2  - The book "Network Flow Algorithms" by David P. Williamson provides a comprehensive overview of efficient combinatorial algorithms for various network flow problems. It covers topics such as maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts. The book also discusses recent research on computing electrical flows and their applications to classical network flow problems. It is a valuable resource for graduate students and researchers in theoretical computer science, operations research, and discrete math who are interested in modeling and solving problems related to the transportation of goods, information, and other applications
ER  -