0.by 0 New 9781107185890 Fast Free Shipping<|

Network Flow AlgorithmsAuthor(s): David P. Williamson\nFormat: Hardback\nPublisher: Cambridge University Press, United Kingdom\nImprint: Cambridge University Press\nISBN-13: 9781107185890, 978-1107185890\nSynopsis\nNetwork 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.