Optimal Cuts and Partitions in Tree Metrics in Polynomial Time.
Marek KarpinskiAndrzej LingasDzmitry SledneuPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- worst case
- additively separable
- optimal solution
- dynamic programming
- tree structure
- clustering algorithm
- special case
- binary search trees
- approximation algorithms
- binary decision tree
- tree models
- linear space
- binary tree
- tree search
- tree structures
- optimal design
- optimal policy
- index structure
- np complete
- image segmentation