{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:31Z","timestamp":1750307551167,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T00:00:00Z","timestamp":1257292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0328881IIS-0534343CNS-0626709"],"award-info":[{"award-number":["IIS-0328881IIS-0534343CNS-0626709"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["IIS-0328881IIS-0534343CNS-0626709"],"award-info":[{"award-number":["IIS-0328881IIS-0534343CNS-0626709"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,11,4]]},"DOI":"10.1145\/1653771.1653803","type":"proceedings-article","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T13:30:15Z","timestamp":1258464615000},"page":"217-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Monitoring minimum cost paths on road networks"],"prefix":"10.1145","author":[{"given":"Yuan","family":"Tian","sequence":"first","affiliation":[{"name":"The Pennsylvania State University, University Park, PA"}]},{"given":"Ken C. K.","family":"Lee","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, University Park, PA"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, University Park, PA"}]}],"member":"320","published-online":{"date-parts":[[2009,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/187382.187805"},{"key":"e_1_3_2_1_3_1","volume-title":"Numerical Mathematics","author":"Dijkstra E.","year":"1959","unstructured":"E. Dijkstra . A Note on Two Problems in Connection with Graphs . Numerical Mathematics , 1959 . E. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerical Mathematics, 1959."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_5_1","first-page":"29","article-title":"Distributed network protocols","author":"Segali A.","year":"1983","unstructured":"A. Segali . Distributed network protocols . IEEE Transaction on Information Theory , 29 , 1983 . A. Segali. Distributed network protocols. IEEE Transaction on Information Theory, 29, 1983.","journal-title":"IEEE Transaction on Information Theory"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129784"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.222926"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"e_1_3_2_1_9_1","first-page":"20","volume-title":"Continuous Evaluation of Fastest Path Queries on Road Networks. In SSTD'07","author":"C.-C.","year":"2007","unstructured":"C.-C. L. et al . Continuous Evaluation of Fastest Path Queries on Road Networks. In SSTD'07 , pages 20 -- 37 , 2007 . C.-C. L. et al. Continuous Evaluation of Fastest Path Queries on Road Networks. In SSTD'07, pages 20--37, 2007."},{"key":"e_1_3_2_1_10_1","first-page":"212","volume-title":"Fully Dynamic Output Bounded Single Source Shortest Path Problem. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms","author":"D.","year":"1996","unstructured":"D. F. et al . Fully Dynamic Output Bounded Single Source Shortest Path Problem. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms , pages 212 -- 221 , 1996 . D. F. et al. Fully Dynamic Output Bounded Single Source Shortest Path Problem. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages 212--221, 1996."},{"volume-title":"Finding Fastest Paths on A Road Network with Speed Patterns. In ICDE'06","author":"E.","key":"e_1_3_2_1_11_1","unstructured":"E. K. et al . Finding Fastest Paths on A Road Network with Speed Patterns. In ICDE'06 . E. K. et al. Finding Fastest Paths on A Road Network with Speed Patterns. In ICDE'06."},{"key":"e_1_3_2_1_12_1","first-page":"794","volume-title":"VLDB'07","author":"H.","unstructured":"H. G. et al. Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach . In VLDB'07 , pages 794 -- 805 . H. G. et al. Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach. In VLDB'07, pages 794--805."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094721"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1216585"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.567054"}],"event":{"name":"GIS '09: 17th SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Seattle Washington","acronym":"GIS '09"},"container-title":["Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653803","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1653771.1653803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:37Z","timestamp":1750249417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,4]]},"references-count":19,"alternative-id":["10.1145\/1653771.1653803","10.1145\/1653771"],"URL":"https:\/\/doi.org\/10.1145\/1653771.1653803","relation":{},"subject":[],"published":{"date-parts":[[2009,11,4]]},"assertion":[{"value":"2009-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}