{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:41Z","timestamp":1763468201783,"version":"build-2065373602"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,3,1]]},"DOI":"10.1109\/tkde.2014.2345386","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T14:42:36Z","timestamp":1407249756000},"page":"686-698","source":"Crossref","is-referenced-by-count":18,"title":["Customizable Point-of-Interest Queries in Road Networks"],"prefix":"10.1109","volume":"27","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1090\/dimacs\/074\/05","article-title":"Reach for A*: Shortest path algorithms with preprocessing","author":"goldberg","year":"2009","journal-title":"The Shortest Path Problem Ninth DIMACS Implementation Challenge"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470362"},{"journal-title":"Flows in Networks","year":"1962","author":"ford jr","key":"ref30"},{"key":"ref37","first-page":"39","article-title":"G-Tree: An efficient index for KNN search on road networks","author":"zhong","year":"0","journal-title":"Proc Int Conf Inf Knowl Manage"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.243"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424365"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICNIDC.2009.5360949"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2330080"},{"key":"ref11","first-page":"52","article-title":"Faster batched shortest paths in road networks","author":"delling","year":"0","journal-title":"Proc 11th Workshop Algorithmic Approaches Transportation Model Optimization Syst"},{"journal-title":"Advanced Route Planning in Transportation Networks","year":"2011","author":"geisberger","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"ref14","first-page":"230","article-title":"A Hub-based labeling algorithm for shortest paths on road networks","author":"abraham","year":"0","journal-title":"Proc 10th Int Symp Exp Algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_5"},{"key":"ref19","first-page":"1","article-title":"Engineering multi-level overlay graphs for shortest-path queries","volume":"13","author":"holzer","year":"2008","journal-title":"ACM J Exp Algorithms"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"ref4","first-page":"865","article-title":"An efficient and scalable approach to CNN queries in a road network","author":"cho","year":"0","journal-title":"Proc VLDB"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559907"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/956676.956677"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quart Appl Math"},{"key":"ref5","first-page":"186","article-title":"Fast nearest neighbor search on road networks","author":"hu","year":"0","journal-title":"Proc Int Conf Extending Database Technology"},{"journal-title":"The Design and Analysis of Spatial Data Structures","year":"1989","author":"samet","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/956676.956678"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238497"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384254"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_30"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref41","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/074","volume":"74","author":"demetrescu","year":"2009","journal-title":"The Shortest Path Problem Ninth DIMACS Implementation Challenge"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","article-title":"Engineering route planning algorithms","author":"delling","year":"2009","journal-title":"Algorithmics of Large and Complex Networks"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/070698774"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525342"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7029750\/06871404.pdf?arnumber=6871404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:26Z","timestamp":1641987686000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6871404\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2345386","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}