{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:53:53Z","timestamp":1743130433224,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223629"},{"type":"electronic","value":"9783319223636"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22363-6_15","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T01:41:51Z","timestamp":1439343711000},"page":"274-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path"],"prefix":"10.1007","author":[{"given":"Sarnath","family":"Ramnath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsuan-Heng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"15_CR1","unstructured":"Oracle spatial and graph. http:\/\/www.oracle.com\/technetwork\/database\/options\/spatialandgraph\/downloads\/navteq-lic-168395.html"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"15_CR3","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. 5868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"15_CR4","first-page":"4:2.4","volume":"4:2.14","author":"R Bauer","year":"2010","unstructured":"Bauer, R., Delling, D.: Sharc: fast and robust unidirectional routing. J. Exp. Algorithmics 4:2.14, 4:2.4\u201329 (2010)","journal-title":"J. Exp. Algorithmics"},{"key":"15_CR5","doi-asserted-by":"publisher","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. Transp. Res. Rec. 1645, 170\u2013175 (1998)","journal-title":"Transp. Res. Rec."},{"key":"15_CR6","doi-asserted-by":"publisher","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. App. 14, 493\u2013498 (1966)","journal-title":"J. Math. Anal. App."},{"key":"15_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Costa, C.F., Nascimento, M.A., de Mac\u00eado, J.A.F., Machado, J.C.: Nearest neighbor queries with service time constraints in time-dependent road networks. In: Proceedings of 2nd ACM SIGSPATIAL MobiGIS 2013, Orlando, Florida, USA, pp. 22\u201329 (2013)","DOI":"10.1145\/2534190.2534194"},{"key":"15_CR9","unstructured":"Dean, B.C.: Shortest paths in fifo time-dependent networks: theory and algorithms. Technical report (2004)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: A case for time-dependent shortest path computation in spatial networks. In: Proceedings of 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2010, pp. 474\u2013477 (2010)","DOI":"10.1145\/1869790.1869865"},{"key":"15_CR11","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)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of 11th International Conference on Extending Database Technology (EDBT), pp. 205\u2013216 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Evans, M.R., Yang, K., Kang, J.M., Shekhar, S.: A lagrangian approach for storage of spatio-temporal network datasets: a summary of results. In: Proceedings of 18th SIGSPATIAL International Conference on Advances in GIS, GIS 2010, pp. 212\u2013221 (2010)","DOI":"10.1145\/1869790.1869822"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 327\u2013341 (2011)","DOI":"10.1137\/1.9781611973082.27"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B George","year":"2007","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: a summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 460\u2013477. Springer, Heidelberg (2007)"},{"key":"15_CR16","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":"VMV Gunturi","year":"2011","unstructured":"Gunturi, V.M.V., Nunes, E., Yang, K.S., 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. 6849, pp. 74\u201391. Springer, Heidelberg (2011)"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TITS.2002.806806","volume":"3","author":"G Jagadeesh","year":"2002","unstructured":"Jagadeesh, G., Srikanthan, T., Quek, K.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Trans. Intell. Transp. Syst. 3(4), 301\u2013309 (2002)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"15_CR18","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), p. 10 (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2670126","volume":"19","author":"D Kirchler","year":"2015","unstructured":"Kirchler, D., Liberti, L., Calvo, R.W.: Efficient computation of shortest paths in time-dependent multi-modal networks. J. Exp. Algorithmics 19, 1\u201329 (2015)","journal-title":"J. Exp. Algorithmics"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ma, Y., Yang, B., Jensen, C.S.: Enabling time-dependent uncertain eco-weights for road networks. In: Proceedings of Workshop on Managing and Mining Enriched Geo-Spatial Data, SIGMOD 2014, p. 1 (2014)","DOI":"10.1145\/2619112.2619113"},{"key":"15_CR21","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of 32nd International Conference on Very Large Data Bases, pp. 43\u201354, September 2006"},{"key":"15_CR22","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\n\t\t\t\t\t$$^ \\ast $$ search for time-dependent fast paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334\u2013346. Springer, Heidelberg (2008)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Pinelli, F., Hou, A., Calabrese, F., Nanni, M., Zegras, C., Ratti, C.: Space and time-dependant bus accessibility: a case study in Rome. In: 12th International IEEE Conference on Intelligent Transportation Systems (2009)","DOI":"10.1109\/ITSC.2009.5309679"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proceedings of 18th SIGSPATIAL International Conference on Advances in GIS, GIS 2010 (2010)","DOI":"10.1145\/1869790.1869807"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22363-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:20:17Z","timestamp":1676960417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22363-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223629","9783319223636"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22363-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}