Generalized Huffman Trees
暂无分享,去创建一个
We generalize the Huffman construction for t-ary trees to the case where the collection of outdegrees for every internal node is given but the outdegrees are not necessarily a constant. The output trees from this construction are called generalized Huffman trees. We prove optimality properties for such trees by generalizing results of Huffman, Hu and Tucker, Glassey and Karp on t-ary trees. We also give a criterion to compare the costs of two generalized Huffman trees with the same collection of outdegrees. This criterion, when applied to binary trees, considerably strengthens a result of Hu.
[1] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .
[2] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[3] Richard M. Karp,et al. On the Optimality of Huffman Trees , 1976 .