Pages that link to "Item:Q3587419"
From MaRDI portal
The following pages link to Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419):
Displaying 12 items.
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems (Q1090604) (← links)
- Forward bounding on pseudo-trees for DCOPs and ADCOPs (Q1677435) (← 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)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- (Q5743496) (← links)
- On competitive recommendations (Q5964063) (← links)