An O(n\log n)-Time Algorithm for the k-Center Problem in Trees.
Haitao WangJingru ZhangPublished in: CoRR (2017)
Keyphrases
- worst case
- preprocessing
- objective function
- experimental evaluation
- improved algorithm
- computational complexity
- tree structure
- probabilistic model
- segmentation algorithm
- detection algorithm
- dynamic programming
- computational cost
- classification algorithm
- optimization algorithm
- input data
- matching algorithm
- path planning
- optimal solution
- learning algorithm
- alphabet size
- neural network
- theoretical analysis
- expectation maximization
- particle swarm optimization
- high accuracy
- cost function
- k means
- evolutionary algorithm
- reinforcement learning
- genetic algorithm