On the Complexity of Shortest Path Problems on Discounted Cost Graphs.
Rajeev AlurSampath KannanKevin TianYifei YuanPublished in: LATA (2013)
Keyphrases
- shortest path problem
- directed graph
- multiple objectives
- pruning power
- interval data
- shortest path
- graph theoretic
- combinatorial optimization problems
- dynamic programming
- space complexity
- optimal policy
- expected cost
- average cost
- computational complexity
- finding the shortest path
- graph model
- total cost
- graph databases
- decision problems
- genetic programming
- finite horizon
- simulated annealing
- polynomial time complexity