On the Optimality of Huffman Trees

DOI10.1137/0131030zbMath0349.05101OpenAlexW2036201654MaRDI QIDQ4119223

C. Roger Glassey, Richard M. Karp

Publication date: 1976

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0131030

Mathematics Subject Classification ID

Trees (05C05) Search theory (90B40)

Related Items (9)

The maximal solution of a restricted subadditive inequality in numerical analysis ⋮ A generalization of binary search ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Huffman's algorithm via algebra ⋮ Huffman coding with non-sorted frequencies ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ A family of restricted subadditive recursions ⋮ Huffman algebras for independent random variables ⋮ Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

This page was built for publication: On the Optimality of Huffman Trees