Greedy partitioned algorithms for the shortest-path problem.
Peter AdamsonEvan TickPublished in: Int. J. Parallel Program. (1991)
Keyphrases
- shortest path problem
- stochastic search
- combinatorial optimization problems
- shortest path
- search algorithm
- dynamic programming
- orders of magnitude
- search methods
- optimization problems
- theoretical analysis
- greedy strategy
- data sets
- directed graph
- combinatorial optimization
- machine learning algorithms
- computationally efficient
- worst case
- computational cost
- multi objective
- computational complexity
- feature selection
- learning algorithm