Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison.
Víctor M. JiménezAndrés MarzalPublished in: WAE (1999)
Keyphrases
- experimental evaluation
- dynamic programming
- optimal solution
- experimental study
- k means
- cost function
- segmentation algorithm
- np hard
- learning algorithm
- high accuracy
- simulated annealing
- computational cost
- computational complexity
- selection algorithm
- optimization algorithm
- classification algorithm
- hardware implementation
- worst case
- data sets
- input data
- expectation maximization
- theoretical analysis
- least squares
- significant improvement
- clustering method
- lower bound
- energy function
- search algorithm
- memory requirements
- bayesian networks
- decision trees
- space complexity