Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Thomas Dueholm HansenHaim KaplanUri ZwickPublished in: SODA (2014)
Keyphrases
- minimum cost
- shortest path
- minimum cost flow
- markov decision processes
- np hard
- spanning tree
- approximation algorithms
- shortest path algorithm
- shortest path problem
- network flow problem
- network flow
- road network
- reinforcement learning
- finding the shortest path
- path length
- flow graph
- minimal surface
- optimal policy
- state space
- geodesic distance
- travel time
- simplex method
- average cost
- weighted graph
- upper bound
- mobile robot
- search space