Optimal alphabetic binary tree for a nonregular cost function

DOI10.1016/0166-218X(84)90128-8MaRDI QIDQ800733zbMATH OpenFDO

Authors Cun-Quan Zhang

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(84)90128-8

zbMATH Keywords

algorithmcost function of a binary treeoptimal alphabetic binary tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• scientific article; zbMATH DE number 437543
• On the Huffman and alphabetic tree problem with general cost functions
• On the Huffman and alphabetic tree problem with general cost functions
• scientific article; zbMATH DE number 1947386

Cites work

• Binary Trees Optimum Under Various Criteria
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cited in

(7)

• Operations research applications of dichotomous search
• On the Huffman and alphabetic tree problem with general cost functions
• Optimal alphabetic trees for binary search
• scientific article; zbMATH DE number 4173001 (Why is no real title available?)
• scientific article; zbMATH DE number 4031716 (Why is no real title available?)
• The Optimal Alphabetic Tree problem revisited
• Old and new results on alphabetic codes

This page was built for publication: Optimal alphabetic binary tree for a nonregular cost function

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