Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.

Ali Ridha Mahjoub S. Thomas McCormick

Published in: Math. Program. (2010)

Keyphrases

max flow
min cut
graph cuts
energy minimization
information theoretic
worst case
interior point
pairwise
image segmentation
objective function
energy function
knapsack problem