{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T14:13:07Z","timestamp":1697983987107},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we examine the problem of finding <jats:italic>k<\/jats:italic>\u2010shortest paths between an origin and destination pair when distances are Euclidean. Two versions of a generalized Dijkstra algorithm are compared. Computational results show that the advantage of the adaptive version (measured by total number of permanent labels) grows with both <jats:italic>k<\/jats:italic> and the network size. For large networks, the adaptive algorithm exhibits a 100:1 advantage in the number of permanent labels set.<\/jats:p>","DOI":"10.1002\/net.3230170308","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:21:47Z","timestamp":1178922107000},"page":"341-352","source":"Crossref","is-referenced-by-count":12,"title":["Computing <i>k<\/i>\u2010shortest path lengths in euclidean networks"],"prefix":"10.1002","volume":"17","author":[{"given":"Christopher C.","family":"Skiscim","sequence":"first","affiliation":[]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(86)90072-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080404"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_5_2","unstructured":"W. G.Lui Steiner trees. Unpublished Master's Thesis Dept. of Combinatorics and Optimization University of Waterloo Waterloo Ontario (1985)."},{"key":"e_1_2_1_6_2","volume-title":"Heuristics","author":"Pearl J.","year":"1984"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840435"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090303"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:29:55Z","timestamp":1697905795000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170308"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170308","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}