Network Flow Algorithms

DOI10.1017/9781316888568zbMath1426.90003OpenAlexW4211250771MaRDI QIDQ5377010

David P. Williamson

Publication date: 21 May 2019

Full work available at URL: https://doi.org/10.1017/9781316888568

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Applications of graph theory to circuits and networks (94C15) Flows in graphs (05C21)

Related Items (15)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ The invisible‐hand heuristic for origin‐destination integer multicommodity network flows ⋮ A combinatorial cut-toggling algorithm for solving Laplacian linear systems ⋮ ReLU neural networks of polynomial size for exact maximum flow computation ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Finding optimal non-datapath caching strategies via network flow ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Online unrelated-machine load balancing and generalized flow with recourse ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ On the motion of substance in a channel and growth of random networks ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ Electrical flows over spanning trees ⋮ Single source unsplittable flows with arc-wise lower and upper bounds

This page was built for publication: Network Flow Algorithms