Pages that link to "Item:Q1401195"
From MaRDI portal
The following pages link to Optimal binary search trees with costs depending on the access paths. (Q1401195):
Displaying 8 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Binary searching with nonuniform costs and its application to text retrieval (Q1977134) (← links)
- A new genetic approach to construct near-optimal binary search trees (Q2383896) (← links)
- The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) (← links)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations (Q5199262) (← links)
- Optimal binary search trees (Q5903763) (← links)