{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:24Z","timestamp":1725900204711},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_5","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"30-42","source":"Crossref","is-referenced-by-count":19,"title":["Faster Customization of Road Networks"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Project OSRM (2012), \n                    \n                      http:\/\/project-osrm.org\/"},{"key":"5_CR2","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":"5_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: SODA, pp. 782\u2013793 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-19754-3_5","volume-title":"Theory and Practice of Algorithms in (Computer) Systems","author":"R. Bader","year":"2011","unstructured":"Bader, R., Dees, J., Geisberger, R., Sanders, P.: Alternative Route Graphs in Road Networks. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol.\u00a06595, pp. 21\u201332. Springer, Heidelberg (2011)"},{"issue":"5824","key":"5_CR5","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":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-13073-1_32","volume-title":"Algorithms and Complexity","author":"R. Bauer","year":"2010","unstructured":"Bauer, R., Columbus, T., Katz, B., Krug, M., Wagner, D.: Preprocessing Speed-Up Techniques is Hard. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 359\u2013370. Springer, Heidelberg (2010)"},{"issue":"2.4","key":"5_CR7","first-page":"1","volume":"14","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM JEA\u00a014(2.4), 1\u201329 (2009)","journal-title":"ACM JEA"},{"issue":"2.3","key":"5_CR8","first-page":"1","volume":"15","author":"R. Bauer","year":"2010","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra\u2019s Algorithm. ACM JEA\u00a015(2.3), 1\u201331 (2010)","journal-title":"ACM JEA"},{"issue":"1","key":"5_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math.\u00a016(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"5_CR10","unstructured":"Columbus, T.: Search space size in contraction hierarchies. Master\u2019s thesis, Karlsruhe Institute of Technology (2012)"},{"key":"5_CR11","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":"5_CR12","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph Partitioning with Natural Cuts. In: Proc. IPDPS, pp. 1135\u20131146. IEEE Computer Society (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: 9th DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074. AMS (2009)","DOI":"10.1090\/dimacs\/074"},{"key":"5_CR14","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\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 (shortest paths). Comm. ACM\u00a05(6), 345 (1962)","journal-title":"Comm. ACM"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton U. Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Funke, S., Storandt, S.: Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Queries. In: Proc. ALENEX, pp. 41\u201354. SIAM (2013)","DOI":"10.1137\/1.9781611972931.4"},{"issue":"3","key":"5_CR18","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 Sci.\u00a046(3), 388\u2013404 (2012)","journal-title":"Transportation Sci."},{"key":"5_CR19","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":"5_CR20","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/070698774","volume":"37","author":"A.V. Goldberg","year":"2008","unstructured":"Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comp.\u00a037, 1637\u20131655 (2008)","journal-title":"SIAM J. Comp."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, et al. (eds.) [13], pp. 93\u2013139","DOI":"10.1090\/dimacs\/074\/05"},{"key":"5_CR22","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.) [13], pp. 41\u201372","DOI":"10.1090\/dimacs\/074\/03"},{"issue":"2.5","key":"5_CR23","first-page":"1","volume":"13","author":"M. Holzer","year":"2008","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM JEA\u00a013(2.5), 1\u201326 (2008)","journal-title":"ACM JEA"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-20662-7_21","volume-title":"Experimental Algorithms","author":"D. Luxen","year":"2011","unstructured":"Luxen, D., Sanders, P.: Hierarchy Decomposition and Faster User Equilibria on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 242\u2013253. Springer, Heidelberg (2011)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Milosavljevic, N.: On optimal preprocessing for contraction hierarchies. In: Proc. SIGSPATIAL IWCTS, pp. 6:1\u20136:6 (2012)","DOI":"10.1145\/2442942.2442949"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Yanagisawa, H.: A multi-source label-correcting algorithm for the all-pairs shortest paths problem. In: Proc. IPDPS, pp. 1\u201310 (2010)","DOI":"10.1109\/IPDPS.2010.5470362"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:30:39Z","timestamp":1557689439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}