Binary Trees Optimum Under Various Criteria
From MaRDI portal
Publication:4199541
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 alphabetic binary tree for a nonregular cost function
- Optimal binary search trees
- Huffman algebras for independent random variables
- Online binary minimax trees
- 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)