{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:33Z","timestamp":1725798633312},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319098722"},{"type":"electronic","value":"9783319098739"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09873-9_61","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T06:04:21Z","timestamp":1407737061000},"page":"728-739","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Customizing Driving Directions with GPUs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Moritz","family":"Kobitzsch","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I. Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"key":"61_CR2","unstructured":"Bast, H., Delling, D., Goldberg, A.V., M\u00fcller\u2013Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. MSR-TR-2014-4 (2014)"},{"issue":"5824","key":"61_CR3","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"key":"61_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2009)"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Davidson, A.A., Baxter, S., Garland, M., Owens, J.D.: Work-efficient parallel GPU methods for single-source shortest paths. In: IPDPS. IEEE (2014)","DOI":"10.1109\/IPDPS.2014.45"},{"issue":"7","key":"61_CR6","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D. Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-accelerated shortest path trees. Journal of Parallel and Distributed Computing\u00a073(7), 940\u2013952 (2013)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"61_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"61_CR8","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks (2013) (submitted for publication)"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: IPDPS, pp. 1135\u20131146. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"61_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-38527-8_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2013","unstructured":"Delling, D., Werneck, R.F.: Faster customization of road networks. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 30\u201342. Springer, Heidelberg (2013)"},{"key":"61_CR11","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge, DIMACS Book\u00a074. AMS (2009)","DOI":"10.1090\/dimacs\/074"},{"issue":"3","key":"61_CR12","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R. Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transportation Science\u00a046(3), 388\u2013404 (2012)","journal-title":"Transportation Science"},{"key":"61_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-20662-7_9","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2011","unstructured":"Geisberger, R., Vetter, C.: Efficient routing in road networks with turn costs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 100\u2013111. Springer, Heidelberg (2011)"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags. In: Demetrescu, et al. (eds.) [11], pp. 41\u201372","DOI":"10.1090\/dimacs\/074\/03"},{"issue":"2.5","key":"61_CR15","first-page":"1","volume":"13","author":"M. Holzer","year":"2008","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics\u00a013(2.5), 1\u201326 (2008)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"61_CR16","doi-asserted-by":"crossref","unstructured":"Madduri, K., Bader, D.A., Berry, J.W., Crobak, J.R.: Parallel shortest path algorithms for solving large-scale instances. In: Demetrescu, et al. (eds.) [11], pp. 249\u2013290","DOI":"10.1090\/dimacs\/074\/10"},{"key":"61_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1007\/978-3-642-01970-8_91","volume-title":"Computational Science \u2013 ICCS 2009","author":"P.J. Mart\u00edn","year":"2009","unstructured":"Mart\u00edn, P.J., Torres, R., Gavilanes, A.: CUDA solutions for the SSSP problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol.\u00a05544, pp. 904\u2013913. Springer, Heidelberg (2009)"},{"issue":"1","key":"61_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U. Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: \u0394-stepping: A parallelizable shortest path algorithm. Journal of Algorithms\u00a049(1), 114\u2013152 (2003)","journal-title":"Journal of Algorithms"},{"key":"61_CR19","doi-asserted-by":"crossref","unstructured":"Ortega-Arranz, H., Torres, Y., Llanos, D., Gonzalez-Escribano, A.: A new GPU-based approach to the shortest path problem. In: HPCS, pp. 505\u2013511 (2013)","DOI":"10.1109\/HPCSim.2013.6641461"},{"key":"61_CR20","doi-asserted-by":"crossref","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comp. Surveys\u00a046(4) (2014)","DOI":"10.1145\/2530531"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09873-9_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:20:05Z","timestamp":1587342005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09873-9_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098722","9783319098739"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}