Binary Trees Optimum Under Various Criteria

DOI10.1137/0137015zbMath0412.68055OpenAlexW2077623653MaRDI QIDQ4199541

No author found.

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

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

Related Items (12)

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

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