Optimal binary trees with order constraints
From MaRDI portal
Recommendations
- Optimal leaf ordering of complete binary trees
- Optimal binary search trees
- Optimal binary search trees
- Height Restricted Optimal Binary Trees
- Binary search trees of almost optimal height
- scientific article; zbMATH DE number 1456949
- Binary Trees and (Maximal) Order Types
- Optimal binary split trees
- scientific article; zbMATH DE number 15358
Cites work
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- A Method for the Construction of Minimum-Redundancy Codes
- A linear-time algorithm for a special case of disjoint set union
- Applications of Path Compression on Balanced Trees
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- On an optimization problem with nested constraints
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- The complexity of selection and ranking in X+Y and matrices with sorted columns
Cited in
(11)- Restructuring ordered binary trees
- Ranking the Best Binary Trees
- scientific article; zbMATH DE number 1445337 (Why is no real title available?)
- The Optimization of Signed Trees
- Height Restricted Optimal Binary Trees
- Optimal binary search trees
- Optimal leaf ordering of complete binary trees
- Minimax trees in linear time with applications
- Partial-order analogue of the secretary problem: The binary tree case
- scientific article; zbMATH DE number 4135962 (Why is no real title available?)
- Assigning bookmarks in perfect binary trees.
This page was built for publication: Optimal binary trees with order constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283811)