Optimal Binary Search Trees with Restricted Maximal Depth
From MaRDI portal
Publication:4776875
DOI10.1137/0203008zbMath0288.68058OpenAlexW2013021781MaRDI QIDQ4776875
Publication date: 1974
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0203008
Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99) General topics in the theory of software (68N01)
Related Items (12)
A new genetic approach to construct near-optimal binary search trees ⋮ Trading off worst and expected cost in decision tree problems ⋮ Optimum multiway search trees ⋮ Parallel lossless image compression using Huffman and arithmetic coding ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Optimal binary search trees ⋮ Optimal alphabetic search trees with restricted maximal height ⋮ Optimal search trees and length restricted codes ⋮ Restructuring binary search trees revisited ⋮ Optimal multiway search trees for variable size keys ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ Optimum extensions of prefix codes.
This page was built for publication: Optimal Binary Search Trees with Restricted Maximal Depth
