{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:22:01Z","timestamp":1726064521934},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_5","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"47-58","source":"Crossref","is-referenced-by-count":11,"title":["Space-Efficient SHARC-Routing"],"prefix":"10.1007","author":[{"given":"Edith","family":"Brunel","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Gemsa","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","first-page":"97","volume-title":"ALENEX","author":"G.V. Batz","year":"2009","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: ALENEX, pp. 97\u2013105. SIAM, Philadelphia (2009)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-642-13193-6_15","volume-title":"SEA 2010","author":"G.V. Batz","year":"2010","unstructured":"Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 166\u2013177. Springer, Heidelberg (2010)"},{"issue":"4","key":"5_CR3","first-page":"2","volume":"14","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM Journal of Experimental Algorithmics\u00a014, 2.4 (2009)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"5_CR4","first-page":"679","volume-title":"SODA","author":"D.K. Blandford","year":"2003","unstructured":"Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact Representation of Separable Graphs. In: SODA, pp. 679\u2013688. SIAM, Philadelphia (2003)"},{"key":"5_CR5","first-page":"49","volume-title":"ALENEX","author":"D.K. Blandford","year":"2004","unstructured":"Blandford, D.K., Blelloch, G.E., Kash, I.A.: An Experimental Analysis of a Compact Graph Representation. In: ALENEX, pp. 49\u201361. SIAM, Philadelphia (2004)"},{"issue":"7","key":"5_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Brunel, E., Delling, D., Gemsa, A., Wagner, D.: Space-Efficient SHARC-Routing. Technical Report\u00a013, ITI Wagner, Faculty of Informatics, Universit\u00e4t Karlsruhe, TH (2009)","key":"5_CR7","DOI":"10.1007\/978-3-642-13193-6_5"},{"doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009)","key":"5_CR8","DOI":"10.1007\/s00453-009-9341-0"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-02011-7_13","volume-title":"SEA 2009","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":"5_CR11","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: Zaroliagis, C. (ed.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"5_CR12","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"},{"key":"5_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)"},{"unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: SODA, pp. 156\u2013165 (2005)","key":"5_CR14"},{"key":"5_CR15","first-page":"26","volume-title":"ALENEX","author":"A.V. Goldberg","year":"2005","unstructured":"Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: ALENEX, pp. 26\u201340. SIAM, Philadelphia (2005)"},{"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, C., Goldberg, A.V., Johnson, D.S. (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074, pp. 41\u201372. American Mathematical Society, Providence (2009)","key":"5_CR16","DOI":"10.1090\/dimacs\/074\/03"},{"unstructured":"Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung, vol.\u00a022, pp. 219\u2013230. IfGI prints (2004)","key":"5_CR17"},{"key":"5_CR18","first-page":"2","volume":"11","author":"R.H. M\u00f6hring","year":"2006","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra\u2019s Algorithm. ACM Journal of Experimental Algorithmics\u00a011, 2.8 (2006)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-68552-4_25","volume-title":"Experimental Algorithms","author":"G. Nannicini","year":"2008","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 334\u2013346. Springer, Heidelberg (2008)"},{"unstructured":"PTV AG - Planung Transport Verkehr (2008), http:\/\/www.ptv.de","key":"5_CR20"},{"key":"5_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:40Z","timestamp":1606168960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}