New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.

Amir Abboud Robert Krauthgamer Ohad Trabelsi

Published in: SODA (2020)

Keyphrases

max flow
lower bound
worst case
min cost
pairwise
upper bound
undirected graph
computational complexity
energy minimization
convex relaxation