{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:31Z","timestamp":1759637731898},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_3","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"23-34","source":"Crossref","is-referenced-by-count":16,"title":["Alternative Routes in Road Networks"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","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":"3_CR2","unstructured":"Cambridge Vehicle Information Technology Ltd. Choice Routing (2005), http:\/\/www.camvit.com"},{"key":"3_CR3","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1962","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton (1962)"},{"key":"3_CR4","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":"3_CR5","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":"3_CR6","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): 9th DIMACS Implementation Challenge - Shortest Paths (2006) http:\/\/www.dis.uniroma1.it\/~challenge9\/"},{"key":"3_CR7","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":"3_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the k shortest paths. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1994), pp. 154\u2013165 (1994)","DOI":"10.1109\/SFCS.1994.365697"},{"key":"3_CR9","first-page":"124","volume-title":"ALENEX","author":"R. Geisberger","year":"2010","unstructured":"Geisberger, R., Kobitzsch, M., Sanders, P.: Route Planning with Flexible Objective Functions. In: ALENEX, pp. 124\u2013137. SIAM, Philadelphia (2010)"},{"key":"3_CR10","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":"3_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074, pp. 93\u2013139. American Mathematical Society, Providence (2009)","DOI":"10.1090\/dimacs\/074\/05"},{"key":"3_CR12","first-page":"100","volume-title":"ALENEX","author":"R.J. Gutman","year":"2004","unstructured":"Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: ALENEX, pp. 100\u2013111. SIAM, Philadelphia (2004)"},{"key":"3_CR13","first-page":"109","volume-title":"Multiple Criteria Decision Making: Theory and Application","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making: Theory and Application, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"26","author":"E.Q. Martins","year":"1984","unstructured":"Martins, E.Q.: On a Multicriteria Shortest Path Problem. European Journal of Operational Research\u00a026(3), 236\u2013245 (1984)","journal-title":"European Journal of Operational Research"}],"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_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:36Z","timestamp":1606186956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}