A tight bound on the min-ratio edge-partitioning problem of a tree.
An-Chiang ChuBang Ye WuHung-Lung WangKun-Mao ChaoPublished in: Discret. Appl. Math. (2010)
Keyphrases
- lower bound
- upper bound
- worst case
- space partitioning
- edge detection
- tree structure
- minimum spanning trees
- vertex set
- decision trees
- generalization error bounds
- hierarchical tree
- leaf nodes
- edge detector
- error bounds
- database
- spanning tree
- weighted graph
- tree structures
- multiple scales
- distance computation
- tree construction
- tree models
- tree nodes
- np hard
- relational databases