Ebook: Network Flow Algorithms

Any new book on network flow would seem to need to justify its existence,
since the definitive book on the topic has perhaps already been written.
I am referring to the magisterial Network Flows: Theory, Algorithms, and
Applications, by Ahuja, Magnanti, and Orlin [4], written by some of the
premier researchers in the theory and practice of efficient network flow
algorithms, and published in 1993; I will refer to the book as AMO, using
the initials of its authors. The late 1980s and early 1990s were a golden era
for research in combinatorial, polynomial-time algorithms for network flow
problems, and not only does AMO discuss most of the work done during this
period, it also gives an extensive overview of the entire area of network flows
and is full of applications of network flow theory to practical problems. So why
another book on the topic? I offer three reasons.