Pages that link to "Item:Q2428690"
From MaRDI portal
The following pages link to Approximating optimal binary decision trees (Q2428690):
Displaying 16 items.
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Performance bounds for binary testing with arbitrary weights (Q1083851) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Algorithms for optimal dyadic decision trees (Q1959591) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- (Q2768928) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419) (← links)
- Weighted decision trees where the cost of a test depends on its outcome (Q3804050) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- Machine Learning: ECML 2004 (Q5450727) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479364) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
- Partial order multiway search (Q6535268) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)