A 2-approximation algorithm for the clustered minimum routing cost tree problem.
Chen-Wan LinBang Ye WuPublished in: ICS (2014)
Keyphrases
- tree structure
- preprocessing
- detection algorithm
- particle swarm optimization
- ant algorithm
- convergence rate
- learning algorithm
- worst case
- similarity measure
- np hard
- cost function
- objective function
- optimal solution
- dynamic programming
- computational complexity
- tree construction
- binary tree
- closed form
- segmentation algorithm
- expectation maximization
- computational cost
- optimization algorithm
- error bounds
- total cost
- simulated annealing
- probabilistic model
- approximation ratio