{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:12:33Z","timestamp":1761487953267},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402053"},{"type":"electronic","value":"9783540448679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44867-5_14","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T01:34:45Z","timestamp":1196386485000},"page":"179-191","source":"Crossref","is-referenced-by-count":26,"title":["A Lazy Version of Eppstein\u2019s K Shortest Paths Algorithm"],"prefix":"10.1007","author":[{"given":"V\u00edctor M.","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Marzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"J. Azevedo","year":"1993","unstructured":"J. Azevedo, M. Costa, J. Madeira, and E. Martins. An algorithm for the ranking of shortest paths. European J. Op. Res., 69:97\u2013106, 1993.","journal-title":"European J. Op. Res."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0377-2217(94)90162-7","volume":"73","author":"J. Azevedo","year":"1994","unstructured":"J. Azevedo, J. Madeira, E. Martins, and F. Pires. A computational improvement for a shortest paths ranking algorithm. European J. Op. Res., 73:188\u2013191, 1994.","journal-title":"European J. Op. Res."},{"issue":"4","key":"14_CR3","first-page":"582","volume":"8","author":"R. Bellman","year":"1960","unstructured":"R. Bellman and R. Kalaba. On kth best policies. J. SIAM, 8(4):582\u2013588, 1960.","journal-title":"J. SIAM"},{"key":"14_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"T. Cormen, C. E. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, Cambridge, MA, 2nd edition, 2001.","edition":"2nd edition"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"S. Dreyfus. An appraisal of some shortest-path algorithms. Op. Res., 17:395\u2013412, 1969.","journal-title":"Op. Res."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"D. Eppstein. Finding the k shortest paths. SIAM J. Computing, 28(2):652\u2013673, 1999.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"14_CR7","first-page":"66","volume":"11","author":"B. L. Fox","year":"1973","unstructured":"B. L. Fox. Calculating kth shortest paths. INFOR \u2014 Canad. J. Op. Res. and Inform. Proces., 11(1):66\u201370, 1973.","journal-title":"INFOR \u2014 Canad. J. Op. Res. and Inform. Proces."},{"issue":"5","key":"14_CR8","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.26.5.686","volume":"26","author":"B. L. Fox","year":"1978","unstructured":"B. L. Fox. Data structures and computer science techniques in operations research. Op. Res., 26(5):686\u2013717, 1978.","journal-title":"Op. Res."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","volume":"1668","author":"V. M. Jim\u00e9nez","year":"1999","unstructured":"V. M. Jim\u00e9nez and A. Marzal. Computing the k shortest paths: a new algorithm and an experimental comparison. Lecture Notes in Computer Science, 1668:15\u201329, 1999. (\n                  http:\/\/terra.act.uji.es\/REA\/papers\/wae99.ps.gz\n                  \n                ).","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR10","unstructured":"E. Martins and J. Santos. A new shortest paths ranking algorithm. Technical report, Departamento de Matem\u00e1tica, Universidade de Coimbra, 1996. (\n                  http:\/\/www.mat.uc.pt\/~eqvm\n                  \n                )."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"E. Q. V. Martins","year":"1984","unstructured":"E. Q. V. Martins. An algorithm for ranking paths that may contain cycles. European J. Op. Res., 18:123\u2013130, 1984.","journal-title":"European J. Op. Res."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45253-2_30","volume":"1879","author":"K. Mehlhorn","year":"2000","unstructured":"K. Mehlhorn and M. Ziegelman. Resource constrained shortest paths. Lecture Notes in Computer Science, 1879:326\u2013337, 2000.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0377-2217(91)90093-B","volume":"53","author":"S. P. Miaou","year":"1991","unstructured":"S. P. Miaou and S. M. Chin. Computing K-shortest paths for nuclear spent fuel highway transportation. European J. Op. Res., 53:64\u201380, 1991.","journal-title":"European J. Op. Res."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230060303","volume":"6","author":"D. R. Shier","year":"1976","unstructured":"D. R. Shier. Iterative methods for determining the k shortest paths in a network. Networks, 6:205\u2013229, 1976.","journal-title":"Networks"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230090303","volume":"9","author":"D. R. Shier","year":"1979","unstructured":"D. R. Shier. On algorithms for finding the k shortest paths in a network. Networks, 9:195\u2013214, 1979.","journal-title":"Networks"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/net.3230170308","volume":"17","author":"C. C. Skicism","year":"1987","unstructured":"C. C. Skicism and B. L. Golden. Computing k-shortest path lengths in euclidean networks. Networks, 17:341\u2013352, 1987.","journal-title":"Networks"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF02216932","volume":"20","author":"C. C. Skicism","year":"1989","unstructured":"C. C. Skicism and B. L. Golden. Solving k-shortest and constrained shortest path problems efficiently. Annals of Op. Res., 20:249\u2013282, 1989.","journal-title":"Annals of Op. Res."}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44867-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T19:44:35Z","timestamp":1551123875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44867-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402053","9783540448679"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44867-5_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}