An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Gerth Stølting BrodalLoukas GeorgiadisIrit KatrielPublished in: Oper. Res. Lett. (2008)
Keyphrases
- times faster
- computationally efficient
- detection algorithm
- learning algorithm
- binary tree
- optimal solution
- tree structure
- significant improvement
- optimization algorithm
- dynamic programming
- high accuracy
- particle swarm optimization
- tree construction
- minimum spanning tree
- experimental evaluation
- computational complexity
- preprocessing
- linear programming
- unordered trees
- search algorithm
- recognition algorithm
- k means
- matching algorithm
- image matching
- cost function
- theoretical analysis
- improved algorithm
- classification trees
- neural network
- objective function
- feature selection
- computational cost