An O(n log n)-Time Algorithm for the k-Center Problem in Trees.
Haitao WangJingru ZhangPublished in: SoCG (2018)
Keyphrases
- improved algorithm
- detection algorithm
- preprocessing
- k means
- worst case
- learning algorithm
- theoretical analysis
- computational complexity
- tree structure
- computational cost
- dynamic programming
- binary tree
- recognition algorithm
- experimental evaluation
- probabilistic model
- multi objective
- high accuracy
- times faster
- classification algorithm
- optimization algorithm
- objective function
- selection algorithm
- matching algorithm
- unordered trees
- expectation maximization
- particle swarm optimization
- markov random field
- np hard
- cost function
- lower bound
- optimal solution
- face recognition