Login / Signup

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.

Satoru IwataS. Thomas McCormickMaiko Shigeno
Published in: Comb. (2003)
Keyphrases
  • minimum cost
  • computational complexity
  • minimum cost flow
  • network flow problem
  • np hard
  • dynamic programming
  • convergence rate
  • search algorithm
  • linear programming
  • network flow
  • capacity constraints