Abstract
In the partial alphabetic tree problem we are given a multiset of nonnegative weights W = {w1,…, wn}, partitioned into k≤n blocks B1,…, Bk. We want to find a binary tree T where the elements of W resides in its leaves such that if we traverse the leaves from left to right then all leaves of B1 precede all leaves of Bj for every i
Cite
CITATION STYLE
APA
Barkan, A., & Kaplan, H. (2002). Partial alphabetic trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2461, pp. 114–125). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free