A faster algorithm for the single source shortest path problem with few distinct positive lengths.
James B. OrlinKamesh MadduriK. SubramaniMatthew D. WilliamsonPublished in: J. Discrete Algorithms (2010)
Keyphrases
- shortest path problem
- single source
- shortest path
- interval data
- multiple objectives
- simulated annealing
- combinatorial optimization problems
- cost function
- multi source
- computational complexity
- k means
- evolutionary algorithm
- dynamic programming
- probabilistic model
- bayesian networks
- np hard
- directed graph
- directed acyclic graph
- multi objective