A simple GAP-canceling algorithm for the generalized maximum flow problem.
Mateo RestrepoDavid P. WilliamsonPublished in: SODA (2006)
Keyphrases
- experimental evaluation
- detection algorithm
- randomly generated
- improved algorithm
- search space
- high accuracy
- dynamic programming
- learning algorithm
- objective function
- computationally efficient
- worst case
- theoretical analysis
- particle swarm optimization
- optimization algorithm
- probabilistic model
- times faster
- computational complexity
- tree structure
- matching algorithm
- convex hull
- simplex algorithm
- segmentation algorithm
- linear programming
- computational cost
- np hard
- cost function
- significant improvement
- optimal solution
- bayesian networks
- similarity measure
- image sequences