Login / Signup

A faster strongly polynomial time algorithm for submodular function minimization.

James B. Orlin
Published in: Math. Program. (2009)
Keyphrases
  • computational complexity
  • objective function
  • worst case
  • dynamic programming
  • learning algorithm
  • optimal solution
  • search space
  • cost function
  • search algorithm