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

Amir Abboud Robert Krauthgamer Ohad Trabelsi

Published in: CoRR (2019)

Keyphrases

max flow
lower bound
min cost
worst case
upper bound
optimization problems
undirected graph
computational complexity
pairwise
special case
level set
global optimization
approximation algorithms
directed acyclic graph
min cut