Network flow algorithms / David P. Williamson
Material type:
TextPublication details: United Kingdom Cambridge University Press 2019Description: 314 pISBN: - 9781316636831
- 9781107185890 (hardback : alk. paper)
- 003 WIL-D
| Item type | Current library | Collection | Shelving location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Books
|
BITS Pilani Hyderabad | 003-007 | General Stack (For lending) | 003 WIL-D (Browse shelf(Opens below)) | Available | 42556 |
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 present 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.
There are no comments on this title.