Approximation Algorithms for Orienteering and Discounted-Reward TSP.
Avrim BlumShuchi ChawlaDavid R. KargerTerran LaneAdam MeyersonMaria MinkoffPublished in: SIAM J. Comput. (2007)
Keyphrases
- approximation algorithms
- discounted reward
- np hard
- markov decision processes
- traveling salesman problem
- average reward
- special case
- policy iteration
- worst case
- vertex cover
- hierarchical reinforcement learning
- optimal solution
- genetic algorithm
- optimal policy
- network design problem
- ant colony optimization
- approximation ratio
- reinforcement learning
- long run
- state and action spaces
- combinatorial optimization
- randomized algorithms
- search space
- optimality criterion
- decision problems
- disjoint paths
- optimization problems
- model free
- constant factor
- linear programming
- machine learning
- dynamic programming
- knapsack problem
- state space
- scheduling problem
- undirected graph
- lower bound
- optimal control
- integer programming
- markov decision problems
- computational complexity
- linear program
- markov chain