A tight max-flow min-cut duality theorem for nonlinear multicommodity flows.

Matthew Broussard Bala Krishnamoorthy

Published in: J. Comb. Optim. (2024)

Keyphrases

max flow min cut
problems in computer vision
energy minimization
lower bound
upper bound
linear programming
combinatorial optimization
network flow
multiscale
dynamic programming
min cut
image segmentation
objective function
cost function
worst case