A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.
Hanno LefmannNiels SchmittPublished in: SIAM J. Comput. (2002)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- times faster
- objective function
- worst case
- np hard
- computationally efficient
- clustering method
- significant improvement
- k means
- search space
- particle swarm optimization
- theoretical analysis
- optimization algorithm
- recognition algorithm
- tree structure
- matching algorithm
- approximation algorithms
- min cost
- cost function
- polynomial time approximation
- max flow
- approximation ratio
- space complexity
- image segmentation
- preprocessing
- detection algorithm
- segmentation algorithm
- data sets
- upper bound
- probabilistic model