Communications of the ACM

Latest Research

From Communications of the ACM

Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution

"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow," by Li Chen et al., comes within striking distance of answering the question: "Does maximum... Shang-Hua Teng
From Communications of the ACM | December 2023

From Communications of the ACM

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs... Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
From Communications of the ACM | December 2023