Login / Signup
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
S. Thomas McCormick
Satoru Fujishige
Published in:
Math. Program. (2010)
Keyphrases
</>
computational complexity
np hard
worst case
minimum cost flow
strongly polynomial
neural network
data structure
special case
optimization problems