{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:54Z","timestamp":1775912994307,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642290374","type":"print"},{"value":"9783642290381","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_41","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"576-591","source":"Crossref","is-referenced-by-count":23,"title":["Traffic Aware Route Planning in Dynamic Road Networks"],"prefix":"10.1007","author":[{"given":"Jiajie","family":"Xu","sequence":"first","affiliation":[]},{"given":"Limin","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Zhiming","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Xiling","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: ICDE 2007, pp. 796\u2013805. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367925"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT 2008, pp. 205\u2013216. ACM (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-22922-0_6","volume-title":"Advances in Spatial and Temporal Databases","author":"V.M.V. Gunturi","year":"2011","unstructured":"Gunturi, V.M.V., Nunes, E., Yang, K., Shekhar, S.: A Critical-Time-Point Approach to all-Start-Time Lagrangian Shortest Paths: A Summary of Results. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol.\u00a06849, pp. 74\u201391. Springer, Heidelberg (2011)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT 2010, pp. 347\u2013358. ACM (2010)","DOI":"10.1145\/1739041.1739084"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., et al.: Finding fastest paths on a road network with speed patterns. In: ICDE 2006, p. 10. IEEE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: ICDE 2010, pp. 261\u2013272. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"Advances in Spatial and Temporal Databases","author":"F.-f. Li","year":"2005","unstructured":"Li, F.-f., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On Trip Planning Queries in Spatial Databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 273\u2013290. Springer, Heidelberg (2005)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Malviya, N., Madden, S., Bhattacharya, A.: A continuous query system for dynamic route planning. In: ICDE 2011, pp. 792\u2013803. IEEE Computer Society (2011)","DOI":"10.1109\/ICDE.2011.5767844"},{"issue":"2","key":"41_CR9","first-page":"69","volume":"4","author":"M.N. Rice","year":"2010","unstructured":"Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB\u00a04(2), 69\u201380 (2010)","journal-title":"PVLDB"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Xiao, Y., et al.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT 2009, pp. 493\u2013504. ACM (2009)","DOI":"10.1145\/1516360.1516418"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Potamias, M., et al.: Fast shortest path distance estimation in large networks. In: CIKM 2009, pp. 867\u2013876. ACM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Gao, J., et al.: Fast top-k simple shortest paths discovery in graphs. In: CIKM 2010, pp. 509\u2013518. ACM (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"41_CR13","unstructured":"Likhachev, M., et al.: Anytime dynamic A*: An anytime, replanning algorithm. In: ICAPS 2005, pp. 262\u2013271 (2005)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Bast, H., et al.: In transit to constant time shortest-path queries in road networks. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.5"},{"issue":"1-2","key":"41_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell.\u00a0155(1-2), 93\u2013146 (2004)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:19:56Z","timestamp":1620127196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}