{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:10:24Z","timestamp":1725707424572},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_7","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T04:00:11Z","timestamp":1353902411000},"page":"93-107","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Route Compression for Hybrid Route Planning"],"prefix":"10.1007","author":[{"given":"Gernot Veit","family":"Batz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Geisberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Luxen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Zubkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97\u2013105. SIAM (April 2009)","DOI":"10.1137\/1.9781611972894.10"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: [21], pp. 166\u2013177","DOI":"10.1007\/978-3-642-13193-6_15"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed Time-Dependent Contraction Hierarchies. In: [21] pp. 83\u201393","DOI":"10.1007\/978-3-642-13193-6_8"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-33090-2_16","volume-title":"Algorithms \u2013 ESA 2012","author":"G.V. Batz","year":"2012","unstructured":"Batz, G.V., Sanders, P.: Time-Dependent Route Planning with Generalized Objective Functions. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 169\u2013180. Springer, Heidelberg (2012)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D. Delling","year":"2011","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica\u00a060(1), 60\u201394 (2011), Special Issue: European Symposium on Algorithms (2008)","journal-title":"Algorithmica"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brunel, E., Delling, D., Gemsa, A., Wagner, D.: Space-Efficient SHARC-Routing. In: [21], pp. 47\u201358","DOI":"10.1007\/978-3-642-13193-6_5"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Kobitzsch, M., Sanders, P.: Route Planning with Flexible Objective Functions. In: Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX 2010), pp. 124\u2013137. SIAM (2010)","DOI":"10.1137\/1.9781611972900.12"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-02011-7_13","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 125\u2013136. Springer, Heidelberg (2009)"},{"key":"7_CR10","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":"7_CR11","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative Routes in Road Networks. In: [21], pp. 23\u201334","DOI":"10.1007\/978-3-642-13193-6_3"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-30850-5_23","volume-title":"Experimental Algorithms","author":"D. Luxen","year":"2012","unstructured":"Luxen, D., Schieferdecker, D.: Candidate Sets for Alternative Routes in Road Networks. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 260\u2013270. Springer, Heidelberg (2012)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science (accepted for publication, 2012)","DOI":"10.1287\/trsc.1110.0401"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-540-87744-8_61","volume-title":"Algorithms - ESA 2008","author":"P. Sanders","year":"2008","unstructured":"Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 732\u2013743. Springer, Heidelberg (2008)"},{"key":"7_CR16","unstructured":"Batz, G.V., Geisberger, R., Luxen, D., Sanders, P.: Compressed Transmission of Route Descriptions. Technical report, Karlsruhe Institute of Technology (KIT) (2010), arXiv:1011.4465v1"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/1989323.1989368","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011","author":"Y. Tao","year":"2011","unstructured":"Tao, Y., Sheng, C., Pei, J.: On k-skip shortest paths. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, pp. 421\u2013432. ACM, New York (2011)"},{"key":"7_CR18","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer (2008)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11427186_18","volume-title":"Experimental and Efficient Algorithms","author":"R.H. M\u00f6hring","year":"2005","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speed Up Dijkstra\u2019s Algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 189\u2013202. Springer, Heidelberg (2005)"},{"key":"7_CR20","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156\u2013165. SIAM (2005)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","year":"2010","unstructured":"Festa, P. (ed.): SEA 2010. LNCS, vol.\u00a06049. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T04:03:22Z","timestamp":1643688202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}