What Costs Are Minimized by Huffman Trees?

DOI10.1137/S0895480103421725zbMATH Open1082.05024OpenAlexW2067968293MaRDI QIDQ5317596FDOQ5317596

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

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

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• Huffman trees and fibonacci numbers
• Title not available (Why is that?)
• Computing and Combinatorics
• Minimax trees in linear time with applications
• Title not available (Why is that?)
• Title not available (Why is that?)

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)