Network Flow Algorithms

Network Flow Algorithms

book type
0 Review(s) 
LF/200595/R
English
In stock
грн157.50
грн141.75 Save 10%

  Instant download 

after payment (24/7)

  Wide range of formats 

(for all gadgets)

  Full book 

(including for Apple and Android)

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.
LF/200595/R

Data sheet

Name of the Author
David P.
Williamson
Language
English
ISBN
9781316952894
Release date
2019

Reviews

Write your review

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 no...

Write your review

15 books by the same author:

Products from this category: