A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract).
Franck ButelleChristian LavaultMarc BuiPublished in: WDAG (1995)
Keyphrases
- extended abstract
- tree structure
- optimal solution
- preprocessing
- binary tree
- computational complexity
- cost function
- times faster
- dynamic programming
- detection algorithm
- segmentation algorithm
- maximum distance
- convergence rate
- optimization algorithm
- theoretical analysis
- computationally efficient
- worst case
- np hard
- feature selection
- global minimum
- search space
- high accuracy
- data sets
- index structure
- computational cost
- matching algorithm
- clustering method
- convex hull
- significant improvement
- weighted graph
- improved algorithm
- minimum spanning tree
- objective function
- input data