Binary Trees Optimum Under Various Criteria

DOI10.1137/0137015MaRDI QIDQ4199541zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

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

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

zbMATH Keywords

binary treesfunctions of path lengthminimizationoptimization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(14)

• Huffman's algorithm via algebra
• Huffman algebras for independent random variables
• Dynamic programming and graph optimization problems
• Operations research applications of dichotomous search
• Minimax trees in linear time with applications
• On the Huffman and alphabetic tree problem with general cost functions
• Online binary minimax trees
• On the cost of optimal alphabetic code trees with unequal letter costs
• Set Orderings Requiring Costliest Alphabetic Binary Trees
• Optimal binary search trees
• Optimum alphabetic binary trees
• Old and new results on alphabetic codes
• Optimal alphabetic binary tree for a nonregular cost function
• Alphabetic coding with exponential costs

This page was built for publication: Binary Trees Optimum Under Various Criteria

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