Optimal Alphabetic Trees
From MaRDI portal
Publication:4094387
DOI10.1137/0205002zbMath0328.68040OpenAlexW1970171209MaRDI QIDQ4094387
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205002
Analysis of algorithms and problem complexity (68Q25) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)
Related Items (17)
A new genetic approach to construct near-optimal binary search trees ⋮ Algorithms for minimum length partitions of polygons ⋮ More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding ⋮ Operations research applications of dichotomous search ⋮ Optimum multiway search trees ⋮ Huffman's algorithm via algebra ⋮ On the cost of optimal alphabetic code trees with unequal letter costs ⋮ 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 ⋮ The construction of optimal multiway search trees and the monotonicity principle ⋮ Restructuring binary search trees revisited ⋮ A counter example to a monotonicity property of k-d trees ⋮ Optimal multiway search trees for variable size keys ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ Optimum extensions of prefix codes. ⋮ Huffman algebras for independent random variables
This page was built for publication: Optimal Alphabetic Trees
