Share
Network Flow Algorithms
David P. Williamson
(Author)
·
Cambridge University Press
· Hardcover
Network Flow Algorithms - Williamson, David P.
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: Spain
(Import costs included in the price)
It will be shipped from our warehouse between
Thursday, June 13 and
Monday, June 24.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "Network Flow Algorithms"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.
✓ Producto agregado correctamente al carro, Ir a Pagar.
