Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Anupam GuptaRavishankar KrishnaswamyViswanath NagarajanR. RaviPublished in: CoRR (2010)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- approximation schemes
- decision trees
- minimum cost
- worst case
- np hardness
- randomized algorithms
- constant factor
- special case
- combinatorial optimization
- network design problem
- exact algorithms
- optimal solution
- dynamic programming
- traveling salesman problem
- primal dual
- precedence constraints
- tabu search
- scheduling problem
- search space
- search algorithm