A polynomial algorithm for the p-centdian problem on a tree.
Arie TamirDionisio Pérez-BritoJosé A. Moreno-PérezPublished in: Networks (1998)
Keyphrases
- tree structure
- learning algorithm
- minimum spanning tree
- experimental evaluation
- preprocessing
- input data
- worst case
- computational cost
- dynamic programming
- search space
- computational complexity
- detection algorithm
- objective function
- binary tree
- optimization algorithm
- improved algorithm
- particle swarm optimization
- cost function
- linear programming
- high accuracy
- significant improvement
- k means
- data structure
- data sets
- polynomially bounded
- convergence rate
- theoretical analysis
- optimal solution
- similarity measure
- neural network