The following pages link to (Q3024773):
Displayed 12 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Scenario Submodular Cover (Q2971162) (← links)
- Average-Case Active Learning with Costs (Q3648749) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- (Q5743496) (← links)