Network Flow Algorithms
Book Details
Format
Hardback or Cased Book
ISBN-10
1107185890
ISBN-13
9781107185890
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Sep 5th, 2019
Print length
326 Pages
Weight
586 grams
Dimensions
15.80 x 23.60 x 1.70 cms
Product Classification:
Numerical analysisAlgorithms & data structures
Ksh 15,650.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.
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.
Get Network Flow Algorithms by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
