A polynomial cycle canceling algorithm for submodular flows.
Claus WallacherUwe T. ZimmermannPublished in: Math. Program. (1999)
Keyphrases
- dynamic programming
- objective function
- times faster
- computational cost
- detection algorithm
- recognition algorithm
- np hard
- experimental evaluation
- improved algorithm
- optimization algorithm
- theoretical analysis
- high accuracy
- worst case
- probabilistic model
- cost function
- preprocessing
- optimal solution
- linear programming
- k means
- computational complexity
- convergence rate
- learning algorithm
- least squares
- significant improvement
- ant colony optimization
- data structure
- convex hull
- memory requirements