Approximation Algorithms for Orienteering and Discounted-Reward TSP.
Avrim BlumShuchi ChawlaDavid R. KargerTerran LaneAdam MeyersonMaria MinkoffPublished in: FOCS (2003)
Keyphrases
- approximation algorithms
- discounted reward
- np hard
- traveling salesman problem
- markov decision processes
- average reward
- special case
- vertex cover
- worst case
- policy iteration
- hierarchical reinforcement learning
- optimal solution
- optimal policy
- ant colony optimization
- genetic algorithm
- reinforcement learning
- network design problem
- state and action spaces
- combinatorial optimization
- optimality criterion
- search space
- optimization problems
- approximation ratio
- scheduling problem
- constant factor
- integer programming
- disjoint paths
- state space
- randomized algorithms
- dynamic programming
- constant factor approximation
- finite state
- linear programming
- multistage
- least squares
- linear program
- approximate solutions
- model free
- undirected graph
- decision problems