Optimal Alphabetic Ternary Trees
J. David Morgenthaler, T. C. Hu
TL;DR
This paper introduces a new algorithm for constructing optimal alphabetic ternary trees with at most three children per internal node, extending the classic Hu-Tucker algorithm.
Contribution
The paper presents a generalized algorithm for optimal alphabetic ternary trees, expanding the scope of the Hu-Tucker algorithm to ternary structures.
Findings
Algorithm successfully constructs optimal ternary trees.
Computational complexity of the algorithm remains undetermined.
Generalizes the classic Hu-Tucker algorithm.
Abstract
We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Error Correcting Code Techniques · semigroups and automata theory