Reducing Search Space of K-Shortest Path Algorithm to Reduce Time Complexity in EON.
Paresh UpadhyayAkhilesh PatelYatindra Nath SinghPublished in: COMSNETS (2024)
Keyphrases
- shortest path algorithm
- search space
- shortest path
- optimal solution
- significantly reduced
- search algorithm
- computational complexity
- reduce the search space
- website
- branch and bound
- decision problems
- metaheuristic
- state space
- computational cost
- maintenance cost
- web services
- complexity analysis
- worst case
- high computational complexity
- space complexity
- global optimum
- fitness function
- database
- artificial neural networks
- multiscale
- information systems
- information retrieval