Abstract
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the problem how many levels it is sufficient to decompose the edges of a tree. In this paper, we show that any n-edge tree can be 2-decomposed (and 3-decomposed) within at most ⌈1.44 log n⌉ (and ⌈log n⌉ respectively) levels. Extreme trees are given to show that the bounds are asymptotically tight. Based on the result, we designed an improved approximation algorithm for the minimum ultrametric tree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Becker R, Perl Y (1983) Shifting algorithms for tree partitioning with general weighting functions. J Algorithms 4:101–120
Becker R, Schach SR, Perl Y (1982) A shifting algorithm for Min-Max tree partitioning. J ACM 29:58–67
Ben-Asher Y, Farchi E, Newman I (1999) Optimal search in trees. SIAM J Comput 28:2090–2102
Farach M, Kannan S, Warnow T (1995) A robust model for finding optimal evolutionary trees. Algorithmica 13:155–179
Gusfield D (1997) Algorithms on strings, trees, and sequences—Computer science and computational biology, Cambridge University Press
Knuth DE (1973) The art of computer programming; Vol. 3 Sorting and Searching. Addison-Wesley, Reading, Massachusetts
Kundu S, Misra J (1977) A linear tree partitioning algorithm. SIAM J Comput 6:151–154
Perl Y, Schach SR (1981) Max-Min tree partitioning. J ACM 28:5–15
Wu BY, Chao KM, Tang CY (1999) Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices. J Comb Optim 3:199–211
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, CM., Wu, B.Y. & Yang, CB. Tree edge decomposition with an application to minimum ultrametric tree approximation. J Comb Optim 12, 217–230 (2006). https://doi.org/10.1007/s10878-006-9626-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9626-z