{"id":"https://openalex.org/W2052686517","doi":"https://doi.org/10.1145/2457317.2457355","title":"Finding nearest neighbors in road networks","display_name":"Finding nearest neighbors in road networks","publication_year":2013,"publication_date":"2013-03-18","ids":{"openalex":"https://openalex.org/W2052686517","doi":"https://doi.org/10.1145/2457317.2457355","mag":"2052686517"},"language":"en","primary_location":{"id":"doi:10.1145/2457317.2457355","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2457317.2457355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint EDBT/ICDT 2013 Workshops","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018682195","display_name":"Fang Wei-Kleiner","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Fang Wei-Kleiner","raw_affiliation_strings":["Link\u00f6ping University, Link\u00f6ing, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Link\u00f6ing, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018682195"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.9576,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.75172777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7521770000457764},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7109458446502686},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6951272487640381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.602025032043457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5610266923904419},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.560531497001648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5081043243408203},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43883100152015686},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4143660068511963},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4014863669872284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.368999719619751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30072394013404846},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22673249244689941},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09053242206573486}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7521770000457764},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7109458446502686},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6951272487640381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.602025032043457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5610266923904419},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.560531497001648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5081043243408203},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43883100152015686},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4143660068511963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4014863669872284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.368999719619751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30072394013404846},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22673249244689941},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09053242206573486},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2457317.2457355","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2457317.2457355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint EDBT/ICDT 2013 Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1493214567","https://openalex.org/W2002471647","https://openalex.org/W2020880764","https://openalex.org/W2041916017","https://openalex.org/W2065759448","https://openalex.org/W2074989152","https://openalex.org/W2099083325","https://openalex.org/W2100586428","https://openalex.org/W2154356512","https://openalex.org/W2155474419","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2171901130"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W2359847778","https://openalex.org/W2810620529","https://openalex.org/W2391048224","https://openalex.org/W2375280931","https://openalex.org/W2385402343","https://openalex.org/W3200343262","https://openalex.org/W2504835324","https://openalex.org/W4298324555","https://openalex.org/W2045787581"],"abstract_inverted_index":{"Finding":[0],"k":[1,45],"Nearest":[2],"Neighbors":[3],"in":[4,19,50],"one":[5],"category":[6],"of":[7,10,48,71,93],"POIs":[8],"(point":[9],"interests)":[11],"belongs":[12],"to":[13],"the":[14,20,65,82],"most":[15],"frequently":[16],"issued":[17],"queries":[18],"navigating":[21],"systems":[22],"or":[23],"online":[24],"maps.":[25],"This":[26],"problem":[27],"can":[28],"be":[29],"formulated":[30],"as":[31,68,77],"given":[32],"a":[33,37],"graph":[34],"G(V,":[35],"E),":[36],"vertex":[38],"u":[39,49],"and":[40,79],"S":[41,60,69],"\u2286":[42],"V,":[43],"finding":[44],"nearest":[46],"neighbors":[47],"S.":[51],"Classic":[52],"Dijkstra's":[53],"algorithm":[54],"offers":[55],"an":[56],"optimal":[57],"solution":[58],"if":[59],"=":[61],"V":[62],"holds,":[63],"but":[64],"performance":[66],"deteriorates":[67],"is":[70],"smaller":[72],"size.":[73],"Other":[74],"approaches":[75],"such":[76],"pre-computing":[78],"storing":[80],"all":[81],"shortest":[83],"distances":[84],"require":[85],"too":[86],"much":[87],"storage,":[88],"thus":[89],"suffer":[90],"from":[91],"drawbacks":[92],"scalability.":[94]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}