Pages that link to "Item:Q3541782"
From MaRDI portal
The following pages link to Approximating Optimal Binary Decision Trees (Q3541782):
Displaying 8 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← 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)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Average-Case Active Learning with Costs (Q3648749) (← links)
- (Q5743496) (← links)
