An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint.
Phan-Thuan DoThai-Duong NguyenQuang-Dung PhamPublished in: SoICT (2011)
Keyphrases
- k means
- preprocessing
- detection algorithm
- learning algorithm
- objective function
- search space
- np hard
- optimization algorithm
- dynamic programming
- computationally efficient
- simulated annealing
- optimal path
- genetic algorithm
- spanning tree
- worst case
- cost function
- computational complexity
- optimal solution
- similarity measure