{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:14Z","timestamp":1750306454670,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,11,3]]},"DOI":"10.1145\/2834126.2834819","type":"proceedings-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T12:09:00Z","timestamp":1461672540000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A\n            <sup>2<\/sup>\n            N\n            <sup>2<\/sup>"],"prefix":"10.1145","author":[{"given":"Saranya","family":"Sadasivam","sequence":"first","affiliation":[{"name":"Auburn University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asif Iqbal","family":"Baba","sequence":"additional","affiliation":[{"name":"Tuskegee University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[{"name":"Auburn University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiquan","family":"Chen","sequence":"additional","affiliation":[{"name":"Valdosta State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Real datasets for spatial databases: Road networks and points of interest (http:\/\/www.cs.fsu.edu\/lifeifei\/spatialdataset.htm). 2005.  Real datasets for spatial databases: Road networks and points of interest (http:\/\/www.cs.fsu.edu\/lifeifei\/spatialdataset.htm). 2005."},{"issue":"2","key":"e_1_3_2_1_2_1","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics","volume":"4","author":"Hart P.","year":"1968","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784462.1784468"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316762"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaman\/8.3.215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"F. Plastria. 4-point fermat location problems revisited. new proofs and extensions of old results. 2005.  F. Plastria. 4-point fermat location problems revisited. new proofs and extensions of old results. 2005.","DOI":"10.1093\/imaman\/dpl007"},{"key":"e_1_3_2_1_10_1","first-page":"248","volume-title":"Digital Information Management, 2006 1st International Conference","author":"Safar M.","year":"2006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.87"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869876"}],"event":{"name":"SIGSPATIAL'15: 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["ESRI","Google Inc.","NVIDIA","Microsoft Microsoft","Facebook Facebook","SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Bellevue Washington","acronym":"SIGSPATIAL'15"},"container-title":["Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834126.2834819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2834126.2834819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:18Z","timestamp":1750225398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834126.2834819"}},"subtitle":["approximate aggregate nearest neighbor queries on road networks"],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":12,"alternative-id":["10.1145\/2834126.2834819","10.1145\/2834126"],"URL":"https:\/\/doi.org\/10.1145\/2834126.2834819","relation":{},"subject":[],"published":{"date-parts":[[2015,11,3]]},"assertion":[{"value":"2015-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}