A faster capacity scaling algorithm for minimum cost submodular flow.
Lisa FleischerSatoru IwataS. Thomas McCormickPublished in: Math. Program. (2002)
Keyphrases
- np hard
- minimum cost
- network flow problem
- network flow
- objective function
- computational complexity
- worst case
- spanning tree
- search space
- dynamic programming
- matching algorithm
- undirected graph
- convergence rate
- distance function
- linear programming
- simulated annealing
- approximation ratio
- lower bound
- maximum flow
- minimum cost flow