An O(nlog n)-Time Algorithm for the k-Center Problem in Trees.
Haitao WangJingru ZhangPublished in: SIAM J. Comput. (2021)
Keyphrases
- times faster
- cost function
- experimental evaluation
- computational cost
- learning algorithm
- objective function
- matching algorithm
- dynamic programming
- binary tree
- detection algorithm
- high accuracy
- np hard
- search space
- decision trees
- worst case
- particle swarm optimization
- expectation maximization
- theoretical analysis
- optimal solution
- estimation algorithm
- probabilistic model
- computationally efficient
- classification algorithm
- improved algorithm
- neural network