A Faster Algorithm for Minimum Cost Submodular Flows.
Satoru IwataS. Thomas McCormickMaiko ShigenoPublished in: SODA (1998)
Keyphrases
- minimum cost
- np hard
- objective function
- computational complexity
- search space
- optimal solution
- network flow problem
- approximation ratio
- spanning tree
- minimum cost flow
- approximation algorithms
- combinatorial optimization
- convex hull
- path planning
- endpoints
- randomly generated
- energy function
- linear programming
- simulated annealing
- dynamic programming
- similarity measure