A simple approximation algorithm for the internal Steiner minimum tree.
Bang Ye WuPublished in: CoRR (2013)
Keyphrases
- tree structure
- computational complexity
- high accuracy
- detection algorithm
- k means
- times faster
- np hard
- experimental evaluation
- dynamic programming
- optimization algorithm
- theoretical analysis
- linear programming
- minimum spanning tree
- learning algorithm
- image sequences
- recognition algorithm
- spanning tree
- closed form
- global minimum
- binary tree
- matching algorithm
- cost function
- preprocessing
- shortest path
- particle swarm optimization
- simulated annealing
- minimum cost
- search space
- suffix tree
- objective function
- similarity measure
- polynomial time approximation