Asymptotic and Exact Results on the Complexity of the Novelli-Pak-Stoyanovskii Algorithm.
Carsten SchneiderRobin SulzgruberPublished in: Electron. J. Comb. (2017)
Keyphrases
- worst case
- computational cost
- dynamic programming
- optimization algorithm
- learning algorithm
- detection algorithm
- np hard
- improved algorithm
- space complexity
- computational complexity
- k means
- times faster
- cost function
- path planning
- high accuracy
- expectation maximization
- segmentation algorithm
- brute force
- matching algorithm
- single pass
- linear programming
- neural network
- significant improvement
- objective function
- computationally efficient
- np complete
- simulated annealing
- experimental evaluation
- convex hull
- convergence rate
- search space
- lower bound
- optimal solution
- high computational complexity
- polynomial time complexity