An Optimal Algorithm for the Indirect Covering Subtree Problem.
Joachim SpoerhasePublished in: CTW (2010)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- high accuracy
- detection algorithm
- objective function
- improved algorithm
- experimental evaluation
- computational complexity
- np hard
- computational cost
- computationally efficient
- globally optimal
- exhaustive search
- times faster
- closed form
- matching algorithm
- tree structure
- search space
- cost function
- significant improvement
- space complexity
- weighting coefficients
- evolutionary algorithm
- recognition algorithm
- convex hull
- theoretical analysis
- data sets
- k means