{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T21:31:05Z","timestamp":1759959065078},"reference-count":8,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0305-0548(03)00111-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"1621-1633","source":"Crossref","is-referenced-by-count":11,"title":["Shortest route computation in distributed systems"],"prefix":"10.1016","volume":"31","author":[{"given":"Jinchang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Kaempke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00111-4_BIB1","unstructured":"Radermacher FJ, Schaal M, Schnittger S. Durchg\u00e4ngige Elektronische Fahrplaninformation - DELFI, Proceedings of 4th world Congress on Intelligent Transportation Systems ITS, Berlin, FAW, Research Institute of Applied Artificial Intelligence, Helmholtzstr. 16, 89081 Ulm, Germany, 1997."},{"key":"10.1016\/S0305-0548(03)00111-4_BIB2","unstructured":"Schnittger S. The EU-SPIRIT API approach, FAW, Research Institute of Applied Artificial Intelligence, Helmholtzstr. 16, 89081 Ulm, Germany, 1999."},{"key":"10.1016\/S0305-0548(03)00111-4_BIB3","unstructured":"Kaempke T, Schaal M. Fast paths, FAW, Research Institute of Applied Artificial Intelligence, Helmholtzstr. 16, 89081 Ulm, Germany."},{"key":"10.1016\/S0305-0548(03)00111-4_BIB4","unstructured":"Kaempke T, Schaal M. Distributed generation of fastest paths, Proceedings of Conference on Parallel and Distributed Computing and Systems PDCS \u201998, Las Vegas, 1998. p. 172\u20137."},{"key":"10.1016\/S0305-0548(03)00111-4_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","article-title":"An algorithm for the ranking of shortest paths","volume":"69","author":"Martins","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00111-4_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connecxion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0305-0548(03)00111-4_BIB7","series-title":"Graphs: theory and algorithms","author":"Thulasiraman","year":"1992"},{"key":"10.1016\/S0305-0548(03)00111-4_BIB8","unstructured":"Papadimitriou K, Christos H, Steiglitz K. Combinatorial optimization, algorithms and complexity, Englewood Cliffs, New Jersey 07632: Prentice-Hall, 1982."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:53:57Z","timestamp":1553165637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":8,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0305054803001114"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00111-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}