Name: Network Flow Algorithms By David P. Williamson (Cornell University, New York)
SKU: 9781107185890
Price: 85.39 GBP
Availability: InStock

Network Flow Algorithms Summary

Network Flow Algorithms by David P. Williamson (Cornell University, New York)

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.

Network Flow Algorithms Reviews

'More than half a century since network flow theory was introduced by the 1962 book of L. R. Ford and D. R. Fulkerson, the area is still active and attractive. This book, based on course materials taught at Stanford and Cornell Universities, offers a concise and succinct description of most of the important topics, as well as covering recent developments. Its use in graduate courses related to algorithms and optimization is highly recommended.' Toshihide Ibaraki, Kyoto College of Graduate Studies for Informatics, Japan
'A succinct and very readable account of network flow algorithms covering the classics and the latest developments. The perfect book for a course on network flow algorithms and a reference for the state of the art. It will be a frequently used addition to my bookshelf.' Kurt Mehlhorn, Max-Planck-Institut fur Informatik
'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

About David P. Williamson (Cornell University, New York)

David P. Williamson is a Professor at Cornell University, New York, in the School of Operations Research and Information Engineering. He has won several awards for his work in discrete optimization, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. His previous book, The Design of Approximation Algorithms (Cambridge, 2011), co-authored with David B. Shmoys, won the 2013 INFORMS Lanchester Prize. He has served on several editor boards, and was editor-in-chief of the SIAM Journal on Discrete Mathematics. He is a Fellow of the ACM and of SIAM.

Additional information

Sku

NPB9781107185890

ISBN 13

9781107185890

ISBN 10

1107185890

Title

Network Flow Algorithms by David P. Williamson (Cornell University, New York)

Author

David P. Williamson (Cornell University, New York)

Condition

New

Binding type

Hardback

Publisher

Cambridge University Press

Year published

2019-09-05

Number of pages

326

Prizes

N/A

Cover note

Book picture is for illustrative purposes only, actual binding, cover or edition may vary.

Note

This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Network Flow Algorithms David P. Williamson (Cornell University, New York)

Network Flow Algorithms by David P. Williamson (Cornell University, New York)

Summary

Network Flow Algorithms Summary

Network Flow Algorithms by David P. Williamson (Cornell University, New York)

Network Flow Algorithms Reviews

About David P. Williamson (Cornell University, New York)

Table of Contents

Additional information

Customer Reviews - Network Flow Algorithms