{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:34:11Z","timestamp":1768095251426,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90214-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"261-267","source":"Crossref","is-referenced-by-count":89,"title":["The all-pairs quickest path problem"],"prefix":"10.1016","volume":"45","author":[{"given":"D.T.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90214-T_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0020-0190(93)90214-T_BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0020-0190(93)90214-T_BIB3","first-page":"371","article-title":"Updating distances in dynamic graphs","volume":"49","author":"Even","year":"1985","journal-title":"Methods Oper. Res."},{"key":"10.1016\/0020-0190(93)90214-T_BIB4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90214-T_BIB5","first-page":"279","article-title":"A dynamization of all pairs least cost path problem","author":"Rohnert","year":"1985","journal-title":"Proc 2nd Ann. Symp. on Theoretical Aspects of Computer Science"},{"key":"10.1016\/0020-0190(93)90214-T_BIB6","unstructured":"J.B. Rosen, S.Z. Sun and G.L. Xue, The quickest path problem and the enumeration of quickest paths, Manuscript."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390214T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390214T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:34Z","timestamp":1555129594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390214T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002001909390214T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90214-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}