{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:40:46Z","timestamp":1743136846431,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_37","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"434-446","source":"Crossref","is-referenced-by-count":0,"title":["Generating Time Dependencies in Road Networks"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Meinert","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Fl\u00f6tter\u00f6d, G.: Traffic State Estimation with Multi-Agent Simulations. PhD thesis, Technische Universit\u00e4t Berlin (2008)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009); Special Issue: European Symposium on Algorithms 2008","DOI":"10.1007\/s00453-009-9341-0"},{"key":"37_CR3","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)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13193-6_15","volume-title":"Experimental Algorithms","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)"},{"key":"37_CR5","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":"37_CR6","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: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"37_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40986-1","volume-title":"The Physics of Traffic","author":"B.S. Kerner","year":"2004","unstructured":"Kerner, B.S.: The Physics of Traffic. Springer, Heidelberg (2004)"},{"issue":"8-9","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.trb.2009.11.004","volume":"44","author":"H. Bar-Gera","year":"2010","unstructured":"Bar-Gera, H.: Traffic assignment by paired alternative segments. Transportation Research Part B: Methodological\u00a044(8-9), 1022\u20131046 (2010)","journal-title":"Transportation Research Part B: Methodological"},{"key":"37_CR9","series-title":"DIMACS Book","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","year":"2009","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074. AMS, Providence (2009)"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S. Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in pcm. IEEE Transactions on Information Theory\u00a028(2), 129\u2013137 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-14355-7_6","volume-title":"Algorithmic Aspects in Information and Management","author":"R. Bauer","year":"2010","unstructured":"Bauer, R., Krug, M., Meinert, S., Wagner, D.: Synthetic Road Networks. In: Chen, B. (ed.) AAIM 2010. LNCS, vol.\u00a06124, pp. 46\u201357. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:10:05Z","timestamp":1558570205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}