{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:44:36Z","timestamp":1758267876815},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_52","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"613-624","source":"Crossref","is-referenced-by-count":13,"title":["An Alternative Approach to Alternative Routes: HiDAR"],"prefix":"10.1007","author":[{"given":"Moritz","family":"Kobitzsch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","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":"52_CR2","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), pp. 129\u2013143. SIAM (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"52_CR3","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":"52_CR4","doi-asserted-by":"crossref","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"52_CR5","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":"52_CR6","unstructured":"Cambridge Vehicle Information Technology Ltd. (Choice Routing)"},{"issue":"1","key":"52_CR7","first-page":"1","volume":"18","author":"I. Abraham","year":"2013","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative Routes in Road Networks. ACM Journal of Experimental Algorithmics\u00a018(1), 1\u201317 (2013)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Luxen, D., Schieferdecker, D.: Candidate Sets for Alternative Routes in Road Networks. ACM Journal of Experimental Algorithmics (submitted, 2013)","DOI":"10.1007\/978-3-642-30850-5_23"},{"key":"52_CR9","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)"},{"key":"52_CR10","unstructured":"Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), pp. 100\u2013111. SIAM (2004)"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-accelerated shortest path trees. Journal of Parallel and Distributed Computing (2012)","DOI":"10.1109\/IPDPS.2011.89"},{"key":"52_CR12","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Faster Batched Shortest Paths in Road Networks. In: Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2011). OpenAccess Series in Informatics (OASIcs), vol.\u00a020, pp. 52\u201363 (2011)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Delling, D., Kobitzsch, M., Luxen, D., Werneck, R.F.: Robust Mobile Route Planning with Limited Connectivity. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX 2012), pp. 150\u2013159. SIAM (2012)","DOI":"10.1137\/1.9781611972924.15"},{"key":"52_CR14","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 for 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":"52_CR15","unstructured":"Kobitzsch, M.: An Alternative to Alternative Routes: HiDAR. Technical Report"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:44:06Z","timestamp":1558010646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}