Netzwerkfluss-Algorithmen von Williamson, David P. [gebunden]
97,62 €
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.
Jetzt bei Ebay:
![Produktbild - Network Flow Algorithms by Williamson, David P. [Paperback]](https://i.ebayimg.com/thumbs/images/g/GTYAAOSwzqVnNUao/s-l140.jpg)
![Produktbild - Network Flow Algorithms [Hardcover] [2019] David P. William](https://i.ebayimg.com/thumbs/images/g/vv4AAOSwJAxmsOFh/s-l140.jpg)
![Produktbild - The Design of Approximation Algorithms by David P. Williamson [Hardback]](https://i.ebayimg.com/thumbs/images/g/ZwQAAOSwySNniGgX/s-l140.jpg)
