{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:09:02Z","timestamp":1725552542885},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311423"},{"type":"electronic","value":"9783540324379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11610113_69","type":"book-chapter","created":{"date-parts":[[2005,12,14]],"date-time":"2005-12-14T05:23:32Z","timestamp":1134537812000},"page":"751-758","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree"],"prefix":"10.1007","author":[{"given":"Yun","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karine","family":"Zeitouni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"69_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/69.755619","volume":"11","author":"D. Barbara","year":"1999","unstructured":"Barbara, D.: Mobile Computing and Databases - A Survey. IEEE Transactions on Knowledge and Data Engineering\u00a011(1), 108\u2013117 (1999)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Chon, H., Agrawal, D., Abbadi, A.E.: FATES: Finding A Time dEpendent Shortest path. In: Proc. of Int. Conf. on Mobile Data Management, pp. 165\u2013180 (2003)","DOI":"10.1007\/3-540-36389-0_12"},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"Deo, N., Pang, C.Y.: Shortest path algorithms: taxonomy and annotation. Networks\u00a014, 275\u2013323 (1984)","journal-title":"Networks"},{"issue":"7","key":"69_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","volume":"32","author":"L. Fu","year":"1996","unstructured":"Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, Part B: Methodological\u00a032(7), 499\u2013516 (1996)","journal-title":"Transportation Research, Part B: Methodological"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in Connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-based Dynamic Attribute Indexing Method. The Computer Journal, 185\u2013200 (1998)","DOI":"10.1093\/comjnl\/41.3.185"},{"issue":"1","key":"69_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H.: The Grid File: An Adaptable, Symmetric Multikey File Structure. Proc. of ACM Trans. On Database Systems\u00a09(1), 38\u201371 (1984)","journal-title":"Proc. of ACM Trans. On Database Systems"},{"key":"69_CR8","unstructured":"Brinkhoff, T.: Network-based Generator of Moving Objects, \n                    \n                      https:\/\/2.zoppoz.workers.dev:443\/http\/www.fh-oow.de\/institute\/iapg\/personen\/brinkhoff\/generastor"}],"container-title":["Lecture Notes in Computer Science","Frontiers of WWW Research and Development - APWeb 2006"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/11610113_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:07:51Z","timestamp":1619492871000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/11610113_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311423","9783540324379"],"references-count":8,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/11610113_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}