An adaptive algorithm for the Euclidean Steiner tree problem in d-space.
Aymeric GrodetTakuya TsuchiyaPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- experimental evaluation
- search space
- times faster
- cost function
- higher dimensional
- detection algorithm
- computational cost
- convergence rate
- improved algorithm
- worst case
- high accuracy
- optimization algorithm
- tree structure
- convex hull
- simulated annealing
- segmentation algorithm
- theoretical analysis
- computationally efficient
- dynamic programming
- significant improvement
- preprocessing
- input data
- linear programming
- probabilistic model
- matching algorithm
- np hard
- k means
- computational complexity