{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:11:38Z","timestamp":1743135098897,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396519"},{"type":"electronic","value":"9783642396526"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-39652-6_4","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T06:18:10Z","timestamp":1383891490000},"page":"85-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Quest for the Shortest Route"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"4_CR4","volume-title":"Network Flows: Theory","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"4_CR18","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"4_CR20","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, Boston (2001)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Series. American Mathematical Society. http:\/\/dimacs.rutgers.edu\/Workshops\/Challenge9\/ (2009). Accessed 15 Feb 2012","key":"4_CR26","DOI":"10.1090\/dimacs\/074"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: The humble programmer. 1972 Turing Award Lecture, Commun. ACM 15(10), 859\u2013866 (1972)","key":"4_CR31","DOI":"10.1145\/355604.361591"},{"unstructured":"Dijkstra, E.W.: This week\u2019s citation classic. Current Contents (CC), Institute for Scientific Information (ISI) (1983)","key":"4_CR32"},{"key":"4_CR33","volume-title":"Out of Their Minds, The Lives and Discoveries of 15 Great Computer Scientists","author":"E.W. Dijkstra","year":"1995","unstructured":"Dijkstra, E.W.: Appalling prose and the shortest path. In: Shasha, D., Lazere, C. (eds.) Out of Their Minds, The Lives and Discoveries of 15 Great Computer Scientists. Copernicus, New York (1995)"},{"issue":"6","key":"4_CR34","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1287\/mnsc.36.6.661","volume":"36","author":"J.J. Divoky","year":"1990","unstructured":"Divoky, J.J., Hung, M.S.: Performance of shortest path algorithms in network flow problems. Manag. Sci. 36(6), 661\u2013673 (1990)","journal-title":"Manag. Sci."},{"key":"4_CR44","volume-title":"Flows in Networks","author":"L.R. Ford Jr","year":"1962","unstructured":"Ford, L.R. Jr., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"3","key":"4_CR45","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34(3), 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"4_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"G. Gallo","year":"1988","unstructured":"Gallo, G., Pallottino, S.: Shortest path algorithms. Ann. Oper. Res. 13, 3\u201379 (1988)","journal-title":"Ann. Oper. Res."},{"unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, Canada, pp. 156\u2013165 (2005)","key":"4_CR50"},{"issue":"2","key":"4_CR56","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"unstructured":"Orosius, P.: Historiarum Adversum Paganos Libri VII. Liber IV, 15. Thorunii (1857). Available online at The Library of Congress, call no. 7252181, http:\/\/archive.org\/details\/adversuspaganosh00oros","key":"4_CR87"},{"unstructured":"PTV: Planung Transport Verkehr AG (2009). http:\/\/www.ptvgroup.com","key":"4_CR93"},{"unstructured":"Sanders, P., Schultes, D.: Robust, almost constant time shortest-path queries in road networks. In: Proceedings of the 9th DIMACS Implementation Challenge Workshop: Shortest Paths. DIMACS Center, Piscataway (2006)","key":"4_CR97"},{"key":"4_CR109","volume-title":"Astronomy Before the Telescope","author":"R. Wells","year":"1996","unstructured":"Wells, R.: Astronomy in Egypt. In: Walker, C. (ed.) Astronomy Before the Telescope. British Museum Press, London (1996)"},{"key":"4_CR110","first-page":"347","volume":"7","author":"J.W.J. Williams","year":"1965","unstructured":"Williams, J.W.J.: Algorithm 232 (heapsort). Commun. ACM 7, 347\u2013348 (1965)","journal-title":"Commun. ACM"}],"container-title":["The Power of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39652-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T15:48:46Z","timestamp":1683820126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39652-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396519","9783642396526"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39652-6_4","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 September 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}