Binary Trees Optimum Under Various Criteria

DOI10.1137/0137015zbMATH Open0412.68055OpenAlexW2077623653MaRDI QIDQ4199541FDOQ4199541

Author name not available (Why is that?)

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

optimizationminimizationbinary treesfunctions of path length

Mathematics Subject Classification ID

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

Cited In (13)

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

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)