Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover.
Anna KuosmanenTopi PaavilainenTravis GagieRayan ChikhiAlexandru I. TomescuVeli MäkinenPublished in: CoRR (2017)
Keyphrases
- dynamic programming
- approximation methods
- directed acyclic graph
- shortest path
- optimal policy
- approximation algorithms
- coarse to fine
- closed form
- state space
- approximation error
- greedy algorithm
- approximation schemes
- model selection
- learning algorithm
- stereo matching
- markov decision processes
- optimal control
- efficient computation
- convex functions
- lagrangian relaxation
- linear programming
- real time