A subexponential algorithm for the coloured tree partition problem.
Roberto CordonePublished in: Discret. Appl. Math. (2007)
Keyphrases
- tree structure
- experimental evaluation
- k means
- computational cost
- times faster
- optimization algorithm
- worst case
- objective function
- improved algorithm
- cost function
- similarity measure
- np hard
- multi objective
- significant improvement
- binary tree
- dynamic programming
- linear programming
- optimal solution
- high accuracy
- theoretical analysis
- lower bound
- detection algorithm
- computational complexity
- classification algorithm
- minimum spanning tree