{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:05:39Z","timestamp":1762272339358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054106"},{"type":"electronic","value":"9783030054113"}],"license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05411-3_3","type":"book-chapter","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T20:37:22Z","timestamp":1543696642000},"page":"28-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Average-Case Behavior of k-Shortest Path Algorithms"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Schickedanz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Ajwani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"3_CR1","unstructured":"Agarwal, U., Ramachandran, V.: Finding $$k$$ simple shortest paths and cycles. In: Proceedings of the 27th ISAAC, LIPIcs, pp. 8:1\u20138:12 (2016)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, U., Ramachandran, V.: Fine-grained complexity for sparse graphs. Proceedings of the 50th STOC, pp. 239\u2013252. ACM (2018)","DOI":"10.1145\/3188745.3188888"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Duriakova, E., Hurley, N., Meyer, U., Schickedanz, A.: An empirical comparison of $$k$$-shortest simple path algorithms on multicores. In: Proceedings of the 47th ICPP (2018)","DOI":"10.1145\/3225058.3225075"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Akiba, T., Hayashi, T., Nori, N., Iwata, Y., Yoshida, Y.: Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling. Proceedings of the 29th AAAI, pp. 2\u20138 (2015)","DOI":"10.1609\/aaai.v29i1.9154"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, A.: A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs. In: Proceedings of the 21st SODA, pp. 742\u2013755 (2010)","DOI":"10.1137\/1.9781611973075.61"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Karger, D.R.: A nearly optimal oracle for avoiding failed vertices and edges. In: Proceedings of the 41st STOC, pp. 101\u2013110 (2009)","DOI":"10.1145\/1536414.1536431"},{"key":"3_CR7","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1017\/CBO9780511814068.004","volume-title":"Models of Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Models of Random Graphs. Cambridge Studies in Advanced Mathematics, 2nd edn, pp. 34\u201359. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F Chung","year":"2001","unstructured":"Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257\u2013279 (2001). https:\/\/doi.org\/10.1006\/aama.2001.0720","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1137\/0111081","volume":"11","author":"S Clarke","year":"1963","unstructured":"Clarke, S., Krikorian, A., Rausen, J.: Computing the N best loopless paths in a network. J. Soc. Ind. Appl. Math. 11(4), 1096\u20131102 (1963)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"5","key":"3_CR10","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1137\/S0097539705429847","volume":"37","author":"C Demetrescu","year":"2008","unstructured":"Demetrescu, C., Thorup, M., Chowdhury, R.A., Ramachandran, V.: Oracles for distances avoiding a failed node or link. SIAM J. Comput. 37(5), 1299\u20131318 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the $$k$$ shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1002\/net.21552","volume":"64","author":"G Feng","year":"2014","unstructured":"Feng, G.: Finding k shortest simple paths in directed graphs: a node classification algorithm. Networks 64(1), 6\u201317 (2014)","journal-title":"Networks"},{"issue":"3","key":"3_CR14","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596\u2013615 (1987)","journal-title":"J. ACM (JACM)"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2630068","volume":"19","author":"A Frieder","year":"2015","unstructured":"Frieder, A., Roditty, L.: An experimental study on approximating $$k$$ shortest simple paths. J. Exp. Algorithmics (JEA) 19, 1\u20135 (2015)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"5","key":"3_CR16","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1137\/070698774","volume":"37","author":"AV Goldberg","year":"2008","unstructured":"Goldberg, A.V.: A practical shortest path algorithm with linear expected time. SIAM J. Comput. 37(5), 1637\u20131655 (2008)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"3_CR17","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.ipl.2008.12.015","volume":"109","author":"Z Gotthilf","year":"2009","unstructured":"Gotthilf, Z., Lewenstein, M.: Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7), 352\u2013355 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR18","first-page":"1","volume":"3","author":"AJ Graham","year":"2008","unstructured":"Graham, A.J., Pike, D.A.: A note on thresholds and connectivity in random directed graphs. Atl. Electron. J. Math. 3(1), 1\u20135 (2008)","journal-title":"Atl. Electron. J. Math."},{"issue":"4","key":"3_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J Hershberger","year":"2007","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans. Algorithms (TALG) 3(4), 45 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"3_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/rsa.3240010106","volume":"1","author":"RM Karp","year":"1990","unstructured":"Karp, R.M.: The transitive closure of a random digraph. Random Struct. Algorithms 1(1), 73\u201394 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"3_CR21","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N Katoh","year":"1982","unstructured":"Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for k shortest simple paths. Networks 12(4), 411\u2013427 (1982)","journal-title":"Networks"},{"key":"3_CR22","unstructured":"Kurz, D., Mutzel, P.: A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph. CoRR\/arXiv:abs\/1601.02867 (2016)"},{"issue":"7","key":"3_CR23","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manag. Sci."},{"issue":"3","key":"3_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"E Martins","year":"1999","unstructured":"Martins, E., Pascoal, M.M., Santos, J.: Deviation algorithms for ranking shortest paths. Int. J. Found. Comput. Sci. 10(3), 247\u2013262 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"3_CR25","first-page":"121","volume":"1","author":"EQ Martins","year":"2003","unstructured":"Martins, E.Q., Pascoal, M.M.: A new implementation of Yens ranking loopless paths algorithm. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 121\u2013133 (2003)","journal-title":"J. Belg. Fr. Ital. Oper. Res. Soc."},{"issue":"1","key":"3_CR26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0196-6774(03)00046-4","volume":"48","author":"U Meyer","year":"2003","unstructured":"Meyer, U.: Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1), 91\u2013134 (2003)","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.3230160204","volume":"16","author":"A Perko","year":"1986","unstructured":"Perko, A.: Implementation of algorithms for k shortest loopless paths. Networks 16(2), 149\u2013160 (1986)","journal-title":"Networks"},{"key":"3_CR28","unstructured":"Priebe, V.: Average-case complexity of shortest-paths problems. Ph.D. thesis, Saarland University (2001). http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2007\/1180\/"},{"issue":"4","key":"3_CR29","first-page":"33","volume":"8","author":"L Roditty","year":"2012","unstructured":"Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms (TALG) 8(4), 33 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"20","key":"3_CR30","doi-asserted-by":"crossref","first-page":"10244","DOI":"10.1016\/j.amc.2012.04.002","volume":"218","author":"A Sede\u00f1o-Noda","year":"2012","unstructured":"Sede\u00f1o-Noda, A.: An efficient time and space K point-to-point shortest simple paths algorithm. Appl. Math. Comput. 218(20), 10244\u201310257 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"3_CR31","doi-asserted-by":"crossref","first-page":"i49","DOI":"10.1093\/bioinformatics\/bts212","volume":"28","author":"YK Shih","year":"2012","unstructured":"Shih, Y.K., Parthasarathy, S.: A single source k-shortest paths algorithm to infer regulatory pathways in a gene network. Bioinformatics 28(12), i49\u2013i58 (2012)","journal-title":"Bioinformatics"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Williams, R.: Subcubic equivalences between path, matrix and triangle problems. In: Proceedings of the 51th FOCS, pp. 645\u2013654 (2010)","DOI":"10.1109\/FOCS.2010.67"},{"issue":"11","key":"3_CR33","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the $$k$$ shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05411-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T08:56:32Z","timestamp":1662540992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05411-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,2]]},"ISBN":["9783030054106","9783030054113"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05411-3_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018,12,2]]},"assertion":[{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}