On an optimal split tree problem
From MaRDI portal
Cited in
(15)- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Trading off worst and expected cost in decision tree problems
- Approximating decision trees with value dependent testing costs
- Approximating optimal binary decision trees
- Scenario submodular cover
- Average-case active learning with costs
- Improved approximation algorithms for the average-case tree searching problem
- Adaptive submodular ranking and routing
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- An approximation algorithm for binary searching in trees
- On the complexity of searching in trees and partially ordered structures
- Partial order multiway search
- A simple approximation algorithm for optimal decision tree
- Old and new results on alphabetic codes
This page was built for publication: On an optimal split tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024773)