Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm.
Carsten SchneiderRobin SulzgruberPublished in: CoRR (2016)
Keyphrases
- worst case
- computational complexity
- dynamic programming
- k means
- detection algorithm
- computational cost
- space complexity
- segmentation algorithm
- cost function
- recognition algorithm
- preprocessing
- experimental evaluation
- objective function
- computationally efficient
- memory requirements
- neural network
- times faster
- matching algorithm
- linear complexity
- high accuracy
- theoretical analysis
- convex hull
- mobile robot
- np hard
- selection algorithm
- search space
- single pass
- high computational complexity
- optimal solution