An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path.
Teresa GomesJosé M. F. CraveirinhaLúcia MartinsMarta PascoalPublished in: DRCN (2001)
Keyphrases
- maximum number
- dynamic programming
- learning algorithm
- optimal solution
- cost function
- preprocessing
- experimental evaluation
- image sequences
- times faster
- optimization algorithm
- np hard
- computational cost
- probabilistic model
- worst case
- shortest path problem
- high accuracy
- significant improvement
- k means
- recognition algorithm
- computational complexity
- path finding