+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Network Flow Algorithms - David P. Williamson

Network Flow Algorithms

Paperback Published: 5th September 2019
ISBN: 9781316636831
Number Of Pages: 326

Share This Book:
Ships in 7 to 10 business days

Earn 147 Qantas Points
on this Book

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.

Industry Reviews

'More than half a century since network flow theory was introduced by the 1962 book of L. R. Ford and D. R. Fulkerson, the area is still active and attractive. This book, based on course materials taught at Stanford and Cornell Universities, offers a concise and succinct description of most of the important topics, as well as covering recent developments. Its use in graduate courses related to algorithms and optimization is highly recommended.' Toshihide Ibaraki, Kyoto College of Graduate Studies for Informatics, Japan
'A succinct and very readable account of network flow algorithms covering the classics and the latest developments. The perfect book for a course on network flow algorithms and a reference for the state of the art. It will be a frequently used addition to my bookshelf.' Kurt Mehlhorn, Max-Planck-Institut fur Informatik
`More than half a century since network flow theory was introduced by the 1962 book of L. R. Ford and D. R. Fulkerson, the area is still active and attractive. This book, based on course materials taught at Stanford and Cornell Universities, offers a concise and succinct description of most of the important topics, as well as covering recent developments. Its use in graduate courses related to algorithms and optimization is highly recommended.' Toshihide Ibaraki, Kyoto College of Graduate Studies for Informatics, Japan
'A succinct and very readable account of network flow algorithms covering the classics and the latest developments. The perfect book for a course on network flow algorithms and a reference for the state of the art. It will be a frequently used addition to my bookshelf.' Kurt Mehlhorn, Max-Planck-Institut fur Informatik

ISBN: 9781316636831
ISBN-10: 1316636836
Audience: Tertiary; University or College
Format: Paperback
Language: English
Number Of Pages: 326
Published: 5th September 2019
Publisher: CAMBRIDGE UNIV PR
Country of Publication: GB
Dimensions (cm): 23.22 x 16.28  x 1.83
Weight (kg): 0.45

Earn 147 Qantas Points
on this Book