A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
Hanno LefmannNiels SchmittPublished in: LATIN (2002)
Keyphrases
- computational complexity
- worst case
- experimental evaluation
- np hard
- k means
- improved algorithm
- detection algorithm
- computationally efficient
- computational cost
- dynamic programming
- learning algorithm
- matching algorithm
- high accuracy
- significant improvement
- similarity measure
- cost function
- randomized algorithm
- search space
- preprocessing
- simulated annealing
- particle swarm optimization
- expectation maximization
- segmentation algorithm
- optimal solution
- times faster
- approximation ratio
- polynomial time approximation
- polynomial time complexity
- greedy algorithm
- tree structure
- input data
- special case
- data structure
- image segmentation