Optimal alphabetic search trees with restricted maximal height

DOI10.1016/0020-0190(76)90052-1zbMath0319.68021OpenAlexW2056204957MaRDI QIDQ1222957

Russell L. Wessner

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90052-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Algorithms in computer science (68W99)

Related Items (9)

A new genetic approach to construct near-optimal binary search trees ⋮ Operations research applications of dichotomous search ⋮ Optimum multiway search trees ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Optimal binary search trees ⋮ Efficient and compact representations of some non-canonical prefix-free codes ⋮ Restructuring binary search trees revisited ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ Optimum extensions of prefix codes.

Cites Work

• Unnamed Item
• Optimum binary search trees
• Optimal Binary Search Trees with Restricted Maximal Depth

This page was built for publication: Optimal alphabetic search trees with restricted maximal height