On the Optimality and Speed of the Deep Greedy Switching Algorithm for Linear Assignment Problems.
Amgad NaiemMohammed El-BeltagyPublished in: IPDPS Workshops (2013)
Keyphrases
- detection algorithm
- experimental evaluation
- dynamic programming
- improved algorithm
- optimal solution
- preprocessing
- search space
- computational cost
- data sets
- greedy strategy
- computationally efficient
- np hard
- cost function
- computational complexity
- significant improvement
- learning algorithm
- closed form
- processing speed
- bayesian networks
- optimization algorithm
- linear complexity
- linear programming
- high accuracy
- worst case
- k means
- greedy heuristic
- piecewise linear
- exhaustive search
- real time
- recognition algorithm
- knapsack problem
- greedy algorithm
- convex hull
- ant colony optimization
- clustering method
- segmentation algorithm
- probabilistic model
- lower bound