{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T22:41:19Z","timestamp":1762641679414},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112053"},{"type":"electronic","value":"9783319112060"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11206-0_10","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:31:55Z","timestamp":1410744715000},"page":"86-97","source":"Crossref","is-referenced-by-count":7,"title":["Energy-Efficient Routing: Taking Speed into Account"],"prefix":"10.1007","author":[{"given":"Frederik","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Funke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Aggarwal, V., Aneja, Y., Nair, K.: Minimal spanning tree subject to a side constraint. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 286\u2013295 (1982)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-642-16111-7_35","volume-title":"KI 2010: Advances in Artificial Intelligence","author":"A. Artmeier","year":"2010","unstructured":"Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: Optimal routing for electric vehicles. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS, vol.\u00a06359, pp. 309\u2013316. Springer, Heidelberg (2010)"},{"key":"10_CR3","unstructured":"Eisner, J., Funke, S., Storandt, S.: Optimal route planning for electric vehicles in large networks. In: AAAI Conference on Artificial Intelligence (2011), http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI11\/paper\/view\/3637"},{"key":"10_CR4","unstructured":"Freie Universit\u00e4t Berlin, Institut f\u00fcr Chemie und Biochemie: Kfz energetisch betrachtet (January 2009), http:\/\/www.chemie.fu-berlin.de\/chemistry\/general\/kfz-energetisch.html"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Funke, S., Storandt, S.: Polynomial-time construction of contraction hierarchies for multi-criteria objectives. In: Algorithm Engineering and Experiments (ALENEX), pp. 41\u201354 (2013)","DOI":"10.1137\/1.9781611972931.4"},{"key":"10_CR6","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), http:\/\/portal.acm.org\/citation.cfm?id=1788888.1788912"},{"key":"10_CR7","first-page":"20","volume-title":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS 2012","author":"S. Storandt","year":"2012","unstructured":"Storandt, S.: Quick and energy-efficient routes: Computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS 2012, pp. 20\u201325. ACM, New York (2012)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Route planning for bicycles - exact constrained shortest paths made practical via contraction hierarchy. In: 22nd Int. Conf. on Automated Planning and Scheduling, ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13495"}],"container-title":["Lecture Notes in Computer Science","KI 2014: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11206-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T14:52:15Z","timestamp":1689519135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11206-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112053","9783319112060"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11206-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}