{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:03:37Z","timestamp":1773702217190,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319193144","type":"print"},{"value":"9783319193151","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_28","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"318-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficiently Listing Bounded Length st-Paths"],"prefix":"10.1007","author":[{"given":"Romeo","family":"Rizzi","sequence":"first","affiliation":[]},{"given":"Gustavo","family":"Sacomoto","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37, 213\u2013223 (1990)","journal-title":"J. ACM"},{"key":"28_CR2","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 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 742\u2013755 (2010)","DOI":"10.1137\/1.9781611973075.61"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Birmel\u00e9, E., Ferreira, R., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal listing of cycles and st-paths in undirected graphs. In: Proceedings of the 24th Symposium on Discrete Algorithms (SODA), pp. 1884\u20131896 (2013)","DOI":"10.1137\/1.9781611973105.134"},{"key":"28_CR4","unstructured":"B\u00f6hmov\u00e1, K., Mihal\u00e1k, M., Pr\u00f6ger, T., Sr\u00e1mek, R., Widmayer, P.: Robust routing in urban public transportation: how to find reliable journeys based on past observations. In: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 27\u201341 (2013)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R Dechter","year":"1985","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505\u2013536 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1999)","journal-title":"SIAM J. Comput."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS), pp. 252\u2013259. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1\u201313 (1977)","journal-title":"J. ACM"},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","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":"28_CR12","doi-asserted-by":"publisher","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. Manage. Sci. 18, 401\u2013405 (1972)","journal-title":"Manage. Sci."},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The $$k$$ most vital arcs in the shortest path problem. Oper. Res. Lett. 8(4), 223\u2013227 (1989)","journal-title":"Oper. Res. Lett."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-662-44777-2_35","volume-title":"Algorithms - ESA 2014","author":"R Ferreira","year":"2014","unstructured":"Ferreira, R., Grossi, R., Rizzi, R., Sacomoto, G., Sagot, M.-F.: Amortized $$\\tilde{O}(|V|)$$-delay algorithm for listing chordless cycles in undirected graphs. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 418\u2013429. Springer, Heidelberg (2014)"},{"key":"28_CR15","unstructured":"Roditty, L.: On the k-simple shortest paths problem in weighted directed graphs. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM (2007)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11523468_21","volume-title":"Automata, Languages and Programming","author":"L Roditty","year":"2005","unstructured":"Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 249\u2013260. Springer, Heidelberg (2005)"},{"key":"28_CR17","volume-title":"Algorithms in C, Part 5: Graph Algorithms","author":"R Sedgewick","year":"2001","unstructured":"Sedgewick, R.: Algorithms in C, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley Professional, Reading (2001)","edition":"3"},{"key":"28_CR18","doi-asserted-by":"publisher","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. Manage. Sci. 17, 712\u2013716 (1971)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:25:27Z","timestamp":1675859127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}