K shortest path routing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "K shortest path routing" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2worldcat.org

5^th place

1uci.edu

3,063^rd place

2,041^st place

1books.google.com

3^rd place

1aaai.org

9,352^nd place

5,696^th place

1informs.org

low place

9,066^th place

1siam.org

low place

6,473^rd place

aaai.org

Akiba, Takuya; Hayashi, Takanori; Nori, Nozomi; Iwata, Yoichi; Yoshida, Yuichi (January 2015). "Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling". Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Austin, TX: Association for the Advancement of Artificial Intelligence. pp. 2–8.

books.google.com

Bouillet, Eric; Ellinas, Georgios; Labourdette, Jean-Francois; Ramamurthy, Ramu (2007). "Path Routing – Part 2: Heuristics". Path Routing in Mesh Optical Networks. John Wiley & Sons. pp. 125–138. ISBN 9780470015650.

doi.org

Günther, Michael; Schuster, Johann; Siegle, Markus (2010-04-27). "Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA". Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA. ACM. pp. 13–18. doi:10.1145/1772630.1772635. ISBN 978-1-60558-916-9.
Eppstein, David (1998). "Finding the k Shortest Paths" (PDF). SIAM J. Comput. 28 (2): 652–673. doi:10.1137/S0097539795290477.
Yen, J. Y. (1971). "Finding the k-Shortest Loopless Paths in a Network". Management Science. 1 7 (11): 712–716. doi:10.1287/mnsc.17.11.712..
Lawler, Eugene L. (1972-03-01). "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem". Management Science. 18 (7): 401–405. doi:10.1287/mnsc.18.7.401. ISSN 0025-1909.
Hershberger, John; Maxel, Matthew; Suri, Subhash (2007). "Finding the k Shortest Simple Paths: A New Algorithm and its Implementation" (PDF). ACM Transactions on Algorithms. 3 (4). Article 45 (19 pages). doi:10.1145/1290672.1290682. S2CID 10703503.
Xu, Wangtu; He, Shiwei; Song, Rui; Chaudhry, Sohail S. (2012). "Finding the k shortest paths in a schedule-based transit network". Computers & Operations Research. 39 (8): 1812–1826. doi:10.1016/j.cor.2010.02.005. S2CID 29232689.
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz (1996). "Shortest paths algorithms: Theory and experimental evaluation". Mathematical Programming. 73 (2): 129–174. doi:10.1007/BF02592101. ISSN 0025-5610. S2CID 414427.

informs.org

pubsonline.informs.org

Lawler, Eugene L. (1972-03-01). "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem". Management Science. 18 (7): 401–405. doi:10.1287/mnsc.18.7.401. ISSN 0025-1909.

semanticscholar.org

api.semanticscholar.org

Hershberger, John; Maxel, Matthew; Suri, Subhash (2007). "Finding the k Shortest Simple Paths: A New Algorithm and its Implementation" (PDF). ACM Transactions on Algorithms. 3 (4). Article 45 (19 pages). doi:10.1145/1290672.1290682. S2CID 10703503.
Xu, Wangtu; He, Shiwei; Song, Rui; Chaudhry, Sohail S. (2012). "Finding the k shortest paths in a schedule-based transit network". Computers & Operations Research. 39 (8): 1812–1826. doi:10.1016/j.cor.2010.02.005. S2CID 29232689.
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz (1996). "Shortest paths algorithms: Theory and experimental evaluation". Mathematical Programming. 73 (2): 129–174. doi:10.1007/BF02592101. ISSN 0025-5610. S2CID 414427.

siam.org

archive.siam.org

Hershberger, John; Maxel, Matthew; Suri, Subhash (2007). "Finding the k Shortest Simple Paths: A New Algorithm and its Implementation" (PDF). ACM Transactions on Algorithms. 3 (4). Article 45 (19 pages). doi:10.1145/1290672.1290682. S2CID 10703503.

uci.edu

ics.uci.edu

Eppstein, David (1998). "Finding the k Shortest Paths" (PDF). SIAM J. Comput. 28 (2): 652–673. doi:10.1137/S0097539795290477.

worldcat.org

Lawler, Eugene L. (1972-03-01). "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem". Management Science. 18 (7): 401–405. doi:10.1287/mnsc.18.7.401. ISSN 0025-1909.
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz (1996). "Shortest paths algorithms: Theory and experimental evaluation". Mathematical Programming. 73 (2): 129–174. doi:10.1007/BF02592101. ISSN 0025-5610. S2CID 414427.