An efficient fault-containing self-stabilizing algorithm for the shortest path problem.
Tetz C. HuangPublished in: Distributed Comput. (2006)
Keyphrases
- shortest path problem
- single source
- shortest path
- detection algorithm
- simulated annealing
- learning algorithm
- preprocessing
- computationally efficient
- experimental evaluation
- segmentation algorithm
- computational complexity
- dynamic programming
- worst case
- expectation maximization
- search algorithm
- directed graph
- significant improvement
- search space
- optimal solution
- matching algorithm
- bicriteria
- convergence rate
- bi objective
- combinatorial optimization
- times faster
- probabilistic model
- data sources
- k means
- lower bound
- similarity measure