What Costs Are Minimized by Huffman Trees?

DOI10.1137/S0895480103421725MaRDI QIDQ5317596zbMATH OpenOpenAlexFDO

Authors Gunnar Forst, Anders Thorup

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• Minimal Huffman trees
• scientific article; zbMATH DE number 4031716
• On the Huffman and alphabetic tree problem with general cost functions
• On the Huffman and alphabetic tree problem with general cost functions
• On the linear description of the Huffman trees polytope

Cited in

(12)

• Minimal Huffman trees
• Minimax trees in linear time with applications
• Optimal skeleton and reduced Huffman trees
• On the convex hull of Huffman trees
• scientific article; zbMATH DE number 4014747 (Why is no real title available?)
• scientific article; zbMATH DE number 3885303 (Why is no real title available?)
• On the Huffman and alphabetic tree problem with general cost functions
• scientific article; zbMATH DE number 4031716 (Why is no real title available?)
• Huffman trees and fibonacci numbers
• Computing and Combinatorics
• Restricted Hamming–Huffman trees
• Optimal skeleton Huffman trees

This page was built for publication: What Costs Are Minimized by Huffman Trees?

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