On the Optimality of Huffman Trees

DOI10.1137/0131030MaRDI QIDQ4119223zbMATH OpenOpenAlexFDO

Authors C. Roger Glassey, Richard 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)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4119223)