{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:09:52Z","timestamp":1725865792672},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319469218"},{"type":"electronic","value":"9783319469225"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46922-5_11","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:40:50Z","timestamp":1474368050000},"page":"137-149","source":"Crossref","is-referenced-by-count":2,"title":["Finding Least On-Road Travel Time on Road Network"],"prefix":"10.1007","author":[{"given":"Lei","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165. Society for Industrial and Applied Mathematics (2005)","key":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 10. IEEE (2006)","key":"11_CR3","DOI":"10.1109\/ICDE.2006.71"},{"doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advancesin Database Technology, pp. 205\u2013216. ACM (2008)","key":"11_CR4","DOI":"10.1145\/1353343.1353371"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Trans. Res. Record: J. Transp. Res. Board 1645, 170\u2013175 (1998)","journal-title":"Trans. Res. Record: J. Transp. Res. Board"},{"issue":"3","key":"11_CR6","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time dependent edge-length. J. ACM (JACM) 37(3), 607\u2013625 (1990)","journal-title":"J. ACM (JACM)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-22922-0_7","volume-title":"Advances in Spatial and Temporal Databases","author":"U Demiryurek","year":"2011","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online Computation of fastest path in time-dependent spatial networks. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 92\u2013111. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22922-0_7"},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-010-0333-9","volume":"29","author":"EH-C Lu","year":"2011","unstructured":"Lu, E.H.-C., Lee, W.-C., Tseng, V.S.: Mining fastest path from trajectories with multiple destinations in road networks. Knowl. Inf. Syst. 29(1), 25\u201353 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H","volume":"29","author":"X Cai","year":"1997","unstructured":"Cai, X., Kloks, T., Wong, C.: Time-varying shortest path problems with constraints. Networks 29(3), 141\u2013150 (1997)","journal-title":"Networks"},{"unstructured":"Wang, X., Zhou, X., Lu, S.: Spatiotemporal data modelling, management: a survey. In: Proceedings of the 36th International Conference on Technology of Object-Oriented Languages and Systems, TOOLS-Asia 2000, pp. 202\u2013211. IEEE (2000)","key":"11_CR10"},{"issue":"3","key":"11_CR11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s00778-008-0115-0","volume":"18","author":"K Deng","year":"2009","unstructured":"Deng, K., Zhou, X., Shen, H.T., Sadiq, S., Li, X.: Instance optimal query processing in spatial networks. VLDB J. 18(3), 675\u2013693 (2009)","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Zheng, K., Fung, P.C., Zhou, X.: K-nearest neighbor search for fuzzy objects. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 699\u2013710. ACM (2010)","key":"11_CR12","DOI":"10.1145\/1807167.1807243"},{"issue":"9","key":"11_CR13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endowment 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endowment"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 967\u2013982. ACM (2015)","key":"11_CR14","DOI":"10.1145\/2723372.2749456"},{"issue":"2","key":"11_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L Fratta","year":"1973","unstructured":"Fratta, L., Gerla, M., Kleinrock, L.: The flow deviation method: An approach to store-and-forward communication network design. Networks 3(2), 97\u2013133 (1973)","journal-title":"Networks"},{"issue":"3","key":"11_CR16","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the Meeting on Algorithm Engineering and Expermiments, pp. 97\u2013105. Society for Industrial and Applied Mathematics (2009)","key":"11_CR17","DOI":"10.1137\/1.9781611972894.10"},{"issue":"1","key":"11_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-dependent sharc-routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-642-38527-8_6","volume-title":"Experimental Algorithms","author":"J Dibbelt","year":"2013","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Intriguingly simple and fast transit routing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 43\u201354. Springer, Heidelberg (2013)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-13193-6_7","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2010","unstructured":"Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 71\u201382. Springer, Heidelberg (2010)"},{"issue":"3","key":"11_CR21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"11_CR22","first-page":"117","volume":"21","author":"J Halpern","year":"1977","unstructured":"Halpern, J.: Shortest route with time dependent length of edges and limited delay possibilities in nodes. Z. fuer Oper. Res. 21(3), 117\u2013124 (1977)","journal-title":"Z. fuer Oper. Res."},{"issue":"3","key":"11_CR23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21(3), 295\u2013319 (1991)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46922-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:13:54Z","timestamp":1498346034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46922-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319469218","9783319469225"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46922-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}