{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:50:04Z","timestamp":1765806604260},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72845-0_6","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:51:37Z","timestamp":1182862297000},"page":"66-79","source":"Crossref","is-referenced-by-count":64,"title":["Dynamic Highway-Node Routing"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Schultes","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: 6th Workshop on Experimental Algorithms (2007)","DOI":"10.1007\/978-3-540-72845-0_2"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.jcss.2005.05.007","volume":"72","author":"J. Fakcharoenphol","year":"2006","unstructured":"Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci.\u00a072(5), 868\u2013889 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR3","unstructured":"Klein, P.: Multiple-source shortest paths in planar graphs. In: 16th ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 146\u2013155 (2005)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/351827.384254","volume":"5","author":"F. Schulz","year":"2000","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s algorithm on-line: an empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics\u00a05, 12 (2000)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. In: Workshop on Algorithm Engineering and Experiments. Proceedings in Applied Mathematics. SIAM pp. vol. 129, pp. 156\u2013170 (2006)","DOI":"10.1137\/1.9781611972863.15"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multi-level overlay graphs for shortest-path queries. invited for ACM Journal of Experimental Algorithmics (special issue Alenex 2006) (2007)","DOI":"10.1137\/1.9781611972863.15"},{"key":"6_CR7","unstructured":"Bauer, R.: Dynamic speed-up techniques for Dijkstra\u2019s algorithm. Diploma Thesis, Universit\u00e4t Karlsruhe (TH) (2006)"},{"key":"6_CR8","unstructured":"Bruera, F., Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D.: On the dynamization of shortest path overlay graphs. Technical Report 0026, ARRIVAL (2006)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"key":"6_CR11","unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments, pp. 100\u2013111 (2004)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Kaplan, H., Werneck, R.: Reach for A *: Efficient point-to-point shortest path algorithms. In: Workshop on Algorithm Engineering & Experiments, Miami, pp. 129\u2013143 (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: Intransit to constant time shortest-path queries in road networks. In: Workshop on Algorithm Engineering and Experiments (2007)","DOI":"10.1137\/1.9781611972870.5"},{"issue":"2","key":"6_CR14","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.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on System Science and Cybernetics"},{"key":"6_CR15","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A * meets graph theory. Technical Report MSR-TR-2004-24, Microsoft Research (2004)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: 6th Workshop on Experimental Algorithms (2007)","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"6_CR17","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway hierarchies star. In: 9th DIMACS Implementation Challenge (2006), http:\/\/www.dis.uniroma1.it\/~challenge9\/"},{"key":"6_CR18","unstructured":"R Development Core Team: R: A Language and Environment for Statistical Computing (2004), http:\/\/www.r-project.org"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing many-to-many shortest paths using highway hierarchies. In: Workshop on Algorithm Engineering and Experiments (2007)","DOI":"10.1137\/1.9781611972870.4"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72845-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:51Z","timestamp":1605762351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72845-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728443"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72845-0_6","relation":{},"subject":[]}}