{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:51:08Z","timestamp":1756000268004},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_23","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T21:44:33Z","timestamp":1338155073000},"page":"260-270","source":"Crossref","is-referenced-by-count":21,"title":["Candidate Sets for Alternative Routes in Road Networks"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Luxen","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Schieferdecker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_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":"23_CR2","doi-asserted-by":"crossref","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transact. on Syst. Sci. and Cybernetics 4 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"23_CR3","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). SIAM (2005)"},{"key":"23_CR4","unstructured":"Lauther, U.: Slow preprocessing of graphs for extremely fast shortest path calculations. In: Workshop on Computational Integer Programming at ZIB (1997)"},{"key":"23_CR5","first-page":"219","volume":"22","author":"U. Lauther","year":"2004","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilit\u00e4t\u2014von der Forschung zur praktischen Anwendung\u00a022, 219\u2013230 (2004)","journal-title":"Geoinformation und Mobilit\u00e4t\u2014von der Forschung zur praktischen Anwendung"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speedup dijkstra\u2019s algorithm. J. Exp. Algorithmics 11 (2007)","DOI":"10.1145\/1187436.1216585"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11427186_13","volume-title":"Experimental and Efficient Algorithms","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 126\u2013138. Springer, Heidelberg (2005)"},{"key":"23_CR8","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":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1868237.1868241","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 Journ. of Exp. Algorithmics\u00a015, 1\u201331 (2010)","journal-title":"ACM Journ. of Exp. Algorithmics"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: Proc. of the 21st Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA 2010 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-22006-7_58","volume-title":"Automata, Languages and Programming","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-Dimension and Shortest Path Algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 690\u2013699. Springer, Heidelberg (2011)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"23_CR13","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative Routes in Road Networks (2011), \n                    \n                      http:\/\/88.198.59.15\/~delling\/tmp\/alternativesJEA.pdf"},{"key":"23_CR14","unstructured":"Cambridge Vehicle Information Tech. Ltd: Choice Routing, \n                    \n                      http:\/\/camvit.com"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph Partitioning with Natural Cuts. In: 25th International Parallel and Distributed Processing Symposium (IPDPS 2011). IEEE Computer Society (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-23719-5_40","volume-title":"Algorithms \u2013 ESA 2011","author":"P. Sanders","year":"2011","unstructured":"Sanders, P., Schulz, C.: Engineering Multilevel Graph Partitioning Algorithms. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 469\u2013480. Springer, Heidelberg (2011)"},{"key":"23_CR17","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The 9th DIMACS Implementation Challenge \u2013 Shortest Paths. American Mathematical Society (2006)"},{"key":"23_CR18","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":"23_CR19","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: 25th International Parallel and Distributed Processing Symposium (IPDPS 2011). IEEE (2011)","DOI":"10.1109\/IPDPS.2011.89"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:03:04Z","timestamp":1558299784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}