Euclidean Steiner minimum trees: An improved exact algorithm.
Pawel WinterMartin ZachariasenPublished in: Networks (1997)
Keyphrases
- experimental evaluation
- computational complexity
- cost function
- times faster
- preprocessing
- k means
- brute force
- optimal solution
- matching algorithm
- expectation maximization
- clustering algorithm
- recognition algorithm
- convergence rate
- tree structure
- optimization algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- worst case
- probabilistic model
- dynamic programming
- detection algorithm
- clustering method
- np hard
- lower bound
- similarity measure
- improved algorithm
- learning algorithm
- global minimum
- tree edit distance
- square error