Abstract
We present an O(n4)-time algorithm for the following problem: Given a set of items with known access frequencies, find the optimal binary search tree under the realistic assumption that each comparison can only result in a two-way decision: either an equality comparison or a less-than comparison. This improves the best known result of O(n5) time, which is based on split tree algorithms. Our algorithm relies on establishing thresholds on the frequency of an item that can occur as an equality comparison at the root of an optimal tree.
Cite
CITATION STYLE
Anderson, R., Kannan, S., Karloff, H., & Ladner, R. E. (2001). Thresholds and optimal binary comparison search trees (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2245, pp. 83–95). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
