The following publications are possibly variants of this publication:
- Finding the k shortest paths by ripple-spreading algorithmsXiao-Bing Hu, Chi Zhang, Gong-Peng Zhang, Ming-Kong Zhang, Hang Li, Mark S. Leeson, Jian-Qin Liao. eaai, 87, 2020. [doi]
- A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windowsXiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hai-lin Zhang. icnc 2016: 376-382 [doi]
- Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problemXiao-Bing Hu, Ming-Kong Zhang, Di Hu. cec 2016: 2604-2609 [doi]
- The Ripple-Spreading Algorithm for the $k$-Color Shortest Path ProblemYi-Ming Ma, Hang Zhou, Xiao-Bing Hu. ssci 2022: 1714-1719 [doi]
- A ripple-spreading algorithm to calculate the k best solutions to the project time management problemXiao-Bing Hu, Ming Wang, Qiong Sun, Mark S. Leeson, Ezequiel A. Di Paolo. cisched 2013: 75-82 [doi]
- An approximate ripple-spreading algorithm with terminal h strategyXiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao. ssci 2017: 1-8 [doi]