Login / Signup

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.

S. Thomas McCormickSatoru 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