An algorithm for finding a k-median in a directed tree.
Antoine VigneronLixin GaoMordecai J. GolinGiuseppe F. ItalianoBo LiPublished in: Inf. Process. Lett. (2000)
Keyphrases
- tree structure
- experimental evaluation
- dynamic programming
- learning algorithm
- times faster
- optimization algorithm
- computationally efficient
- high accuracy
- np hard
- cost function
- recognition algorithm
- classification algorithm
- binary tree
- theoretical analysis
- lower bound
- improved algorithm
- minimum spanning tree
- matching algorithm
- optimal solution
- graph structure
- clustering method
- linear programming
- segmentation algorithm
- input data
- data sets
- simulated annealing
- worst case
- multi objective
- search space
- preprocessing
- computational complexity
- neural network