https://www.networkflowalgs.com/

  * Home
  * About
  * Download
  * Order
  * FAQs
  * Errata
  * Contact

David P. Williamson

Network Flow Algorithms

This is the companion website for the book Network Flow Algorithms by
David P. Williamson, published in 2019 by Cambridge University Press.

Order
[cover]
[baseball]

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.

An electronic-only edition of the book is provided in the Download
section.

Download the Book

Below you can download an electronic-only copy of the book. The
electronic-only book is published on this website with the permission
of Cambridge University Press. One copy per user may be taken for
personal use only and any other use you wish to make of the work is
subject to the permission of Cambridge University Press
(rights@cambridge.org). You may not post this file on any other
website.

Table of Contents

Book

Order

The book can be ordered from the following sources, other internet
booksellers, or from your local bookstore. Search for ISBN
9781316636831.

Cambridge

Amazon (US)

Frequently Asked Questions

Q: Why another book on network flow?
   I thought there were enough interesting network flow algorithms
   that did not have a textbook presentation (such as the
   Goldberg-Rao algorithm, and some of the multicommodity flow
A: algorithms) that I wanted a book that would cover these
   algorithms. I also wanted a book that put generalized flow on the
   same footing as more standard flow topics such as max flow and
   minimum-cost flow. It also gave me the opportunity to add in some
   coverage on the recent work on electrical flows.
Q: What is the cover image?
A: It's a sakia, a water lifting device.

Q: Where can I find more material related to the book?
   I teach a class at Cornell, ORIE 6330, based on the contents of
A: the book. If you go to the course website, you can see a syllabus
   of a class I have taught based on the book. I have also posted
   videos of lectures from the book material.

Errata

This page will contain an errata sheet when one is available.
Additional errata can be sent to bugs at networkflowalgs.com.

Contact information


General questions

info at networkflowalgs.com

Comments, Typos, Bugs

bugs at networkflowalgs.com

Permissions

rights at cambridge.org

Copyright (c) All rights reserved | This template is made with by
Colorlib