Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

DOI10.1007/978-3-642-14165-2_58zbMath1288.68267OpenAlexW2152124311MaRDI QIDQ3587419

Viswanath Nagarajan, Anupam Gupta, R. Ravi

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_58

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (9)

Ignorant vs. Anonymous Recommendations ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Trading off worst and expected cost in decision tree problems ⋮ Scenario Submodular Cover ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ On competitive recommendations ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item ⋮ Approximating decision trees with value dependent testing costs

This page was built for publication: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems