A New Algorithm for Minimum Cost Binary Trees
From MaRDI portal
Cited in
(22)- Optimum multiway search trees
- Testing the optimality of alphabetic trees
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- Monotonicity and efficient computation of optimal dichotomous search
- Correctness of constructing optimal alphabetic trees revisited
- Operations research applications of dichotomous search
- On the cost of unsuccessful searches in search trees with two-way comparisons
- On the Huffman and alphabetic tree problem with general cost functions
- Average complexity of searching for identical objects in random nonuniform databases
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Set Orderings Requiring Costliest Alphabetic Binary Trees
- The Optimal Alphabetic Tree problem revisited
- Improved approximation algorithms for the average-case tree searching problem
- Dynamic Trees with Almost-Optimal Access Cost
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- Optimal binary search trees
- Optimum alphabetic binary trees
- Old and new results on alphabetic codes
- Adaptive shivers sort: an alternative sorting algorithm
- Galloping in fast-growth natural merge sorts
- On the redundancy of D-ary Fano codes
This page was built for publication: A New Algorithm for Minimum Cost Binary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4142686)
