{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:54:13Z","timestamp":1772106853838,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003939","type":"print"},{"value":"9783540363897","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,12,16]],"date-time":"2002-12-16T00:00:00Z","timestamp":1039996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36389-0_12","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T00:08:19Z","timestamp":1194998899000},"page":"165-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["FATES: Finding A Time dEpendent Shortest path"],"prefix":"10.1007","author":[{"given":"Hae Don","family":"Chon","sequence":"first","affiliation":[]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"Amr El","family":"Abbadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"12_CR1","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322\u2013331, 1990.","DOI":"10.1145\/93605.98741"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"H. D. Chon, D. Agrawal, and A. El Abbadi. Storage and Retrieval of Moving Objects. In Proceedings of the Int. Conf. on Mobile Data Management, pages 173\u2013184, 2001.","DOI":"10.1007\/3-540-44498-X_14"},{"key":"12_CR4","unstructured":"H. D. Chon, D. Agrawal, and A. El Abbadi. Query processing for moving objects with space-time grid storage model. In Proceedings of the Int. Conf. on Mobile Data Management, 2002."},{"key":"12_CR5","unstructured":"S. Handley, P. Langley, and F. Rauscher. Learning to predict the duration of an automobile trip. In Proceedings of the Int. Conf. on Knowledge Discovery and Data Mining, pages 219\u2013223, 1998."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. J. Tsotras. On Indexing Moving Objects. In Proceedings of ACM Symp. on Principles of Database Systems, pages 261\u2013272, 1999.","DOI":"10.1145\/303976.304002"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(94)E0349-G","volume":"83","author":"K. Nachtigall","year":"1995","unstructured":"K. Nachtigall. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research, 83:154\u2013166, 1995.","journal-title":"European Journal of Operational Research"},{"key":"12_CR8","unstructured":"OnStar. http:\/\/www.onstar.com ."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3):607\u2013625, 1990.","journal-title":"Journal of the ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S. Pallottino and M. G. Scutella. Shortest path algorithms in transportation models: classical and innovative aspects. In In Equilibrium and Advanced Transportation Modelling, Kluwer, pages 245\u2013281, 1998.","DOI":"10.1007\/978-1-4615-5757-9_11"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"C. E. Perkins. Mobile IP. IEEE Communications Magazine, pages 84\u201399, May 1997.","DOI":"10.1109\/35.592101"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D. Pfoser and C. S. Jensen. Capturing the Uncertainty of Moving-Object Representations. In Proc. of the Int. Symposium on Spatial Databases, SSD, pages 111\u2013132, 1999.","DOI":"10.1007\/3-540-48482-5_9"},{"key":"12_CR13","unstructured":"D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel Approaches to the Indexing of Moving Object Trajectories. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 395\u2013406, 2000."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 331\u2013342, 2000.","DOI":"10.1145\/335191.335427"},{"key":"12_CR15","unstructured":"D. Schrank and T. Lomax. The 2001 Urban Mobility Report. Technical report, Texas Transportation Institute, 2001."},{"key":"12_CR16","unstructured":"A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and Querying Moving Objects. In Proceedings of the Int. Conf. on Data Engineering, pages 422\u2013432, 1997."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/41.3.185","volume":"41","author":"J. Tayeb","year":"1998","unstructured":"J. Tayeb, O. Ulusoy, and O. Wolfson. A Quadtree Based Dynamic Attribute Indexing Method. The Computer Journal, 41(3):185\u2013200, 1998.","journal-title":"The Computer Journal"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"M. Vazirgiannis and O. Wolfson. A Spatiotemporal Model and Language for Moving Objects on Road Networks. In Int. Symposium on Spatial and Temporal Databases, pages 20\u201335, 2001.","DOI":"10.1007\/3-540-47724-1_2"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving Objects Databases: Issues and Solutions. In Proceedings of the 10th International Conference on Scientific and Statistical Database Management, pages 111\u2013122, July 1998.","DOI":"10.1109\/SSDM.1998.688116"}],"container-title":["Lecture Notes in Computer Science","Mobile Data Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36389-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:04:22Z","timestamp":1737536662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36389-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003939","9783540363897"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36389-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,16]]},"assertion":[{"value":"16 December 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}