共 56 条
[1]
Ahuja RK(1990)Faster algorithms for the shortest path problem J. ACM (JACM) 37 213-223
[2]
Mehlhorn K(2011)K⁎: a heuristic search algorithm for finding the k shortest paths Artif. Intell. 175 2129-2154
[3]
Orlin J(2019)Post-Disaster least loaded lightpath routing in elastic optical networks Int. J. Commun. Syst. 32 e3920-A289
[4]
Tarjan RE(2017)Resilient optical network technologies for Catastrophic Disasters J. Opt. Commun. Netw. 9 A280-517
[5]
Aljazzar H(1975)Multidimensional binary search trees used for associative searching Commun. ACM 18 509-138
[6]
Leue S(2018)A survey of energy conservation schemes for present and next generation passive optical networks J. Commun. 13 129-673
[7]
Ashraf MW(2019)Machine learning based dynamic load balancing DWBA scheme for TWDM PON Opt. Fiber Technol. 52 101964-226
[8]
Idrus SM(1998)Finding the k shortest paths SIAM J. Comput. 28 652-158
[9]
Butt RA(1977)An algorithm for finding best matches in logarithmic expected time ACM Trans. Math. Softw. (TOMS) 3 209-15
[10]
Iqbal F(2016)Efficient approximation algorithms for computing k J. Comb. Optim. 32 144-59