scientific article; zbMATH DE number 432778

MaRDI QIDQ3138908zbMATH OpenFDO

Authors Lawrence L. Larmore, Daniel S. Hirschberg

Publication date 19 September 1994

zbMATH Keywords

Huffmann's problemprefix-free binary code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45)

Cited in

(3)

• On the Huffman and alphabetic tree problem with general cost functions
• The Optimal Alphabetic Tree problem revisited
• Finding a minimum-weight k-link path in graphs with the concave Monge property and applications

This page was built for publication:

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