{"id":"https://openalex.org/W2343446723","doi":"https://doi.org/10.1109/tkde.2016.2531667","title":"Proxies for Shortest Path and Distance Queries","display_name":"Proxies for Shortest Path and Distance Queries","publication_year":2016,"publication_date":"2016-02-18","ids":{"openalex":"https://openalex.org/W2343446723","doi":"https://doi.org/10.1109/tkde.2016.2531667","mag":"2343446723"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2016.2531667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2016.2531667","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5006980420","display_name":"Shuai Ma","orcid":"https://orcid.org/0000-0002-4050-0443"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shuai Ma","raw_affiliation_strings":["SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191"],"affiliations":[{"raw_affiliation_string":"SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022562323","display_name":"Kaiyu Feng","orcid":"https://orcid.org/0000-0002-4196-9366"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kaiyu Feng","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore 639798"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore 639798","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100380469","display_name":"Jianxin Li","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianxin Li","raw_affiliation_strings":["SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191"],"affiliations":[{"raw_affiliation_string":"SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063351917","display_name":"Haixun Wang","orcid":"https://orcid.org/0009-0007-0773-7004"},"institutions":[{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]},{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haixun Wang","raw_affiliation_strings":["Facebook Inc., Menlo Park, CA 94025"],"affiliations":[{"raw_affiliation_string":"Facebook Inc., Menlo Park, CA 94025","institution_ids":["https://openalex.org/I4210114444","https://openalex.org/I4210099336"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045198704","display_name":"Gao Cong","orcid":"https://orcid.org/0000-0002-4430-6373"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Gao Cong","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore 639798"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore 639798","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110207665","display_name":"Jinpeng Huai","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinpeng Huai","raw_affiliation_strings":["SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191"],"affiliations":[{"raw_affiliation_string":"SKLSDE Lab, School of Computer Science and Engineering, Beihang University, China 100191","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5006980420"],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":1.336,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86434961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"7","first_page":"1835","last_page":"1850"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7969925403594971},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7650493383407593},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.61244797706604},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5734192132949829},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5704827308654785},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5265700817108154},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.49268490076065063},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4575038254261017},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41780540347099304},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3675447106361389},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36182886362075806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34131765365600586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32338324189186096},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16825363039970398},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10198432207107544}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7969925403594971},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7650493383407593},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.61244797706604},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5734192132949829},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5704827308654785},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5265700817108154},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.49268490076065063},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4575038254261017},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41780540347099304},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3675447106361389},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36182886362075806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34131765365600586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32338324189186096},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16825363039970398},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10198432207107544}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2016.2531667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2016.2531667","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3274943203","display_name":null,"funder_award_id":"61322207","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5171771356","display_name":null,"funder_award_id":"2014CB","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G6426900302","display_name":null,"funder_award_id":"340300","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G8055127673","display_name":null,"funder_award_id":"61421003","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320320368","display_name":"Multiple Sclerosis Australia","ror":"https://ror.org/02caat392"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W154362522","https://openalex.org/W1493214567","https://openalex.org/W1551891681","https://openalex.org/W1559814459","https://openalex.org/W1601313669","https://openalex.org/W1706263783","https://openalex.org/W1988593903","https://openalex.org/W2002055996","https://openalex.org/W2007687856","https://openalex.org/W2014889099","https://openalex.org/W2041916017","https://openalex.org/W2045446569","https://openalex.org/W2048096483","https://openalex.org/W2061354107","https://openalex.org/W2063032661","https://openalex.org/W2065714066","https://openalex.org/W2070232376","https://openalex.org/W2076704871","https://openalex.org/W2081863845","https://openalex.org/W2091635795","https://openalex.org/W2096304152","https://openalex.org/W2099083325","https://openalex.org/W2102842495","https://openalex.org/W2104317982","https://openalex.org/W2110452945","https://openalex.org/W2134479550","https://openalex.org/W2145604831","https://openalex.org/W2146333962","https://openalex.org/W2148831787","https://openalex.org/W2153374077","https://openalex.org/W2159394589","https://openalex.org/W2161455936","https://openalex.org/W2163169902","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2768149714","https://openalex.org/W2950552904","https://openalex.org/W2952476710","https://openalex.org/W3183881215","https://openalex.org/W6654186649","https://openalex.org/W6675622114","https://openalex.org/W6683460870"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W2040572217","https://openalex.org/W2352094194","https://openalex.org/W2348504720","https://openalex.org/W2612665926","https://openalex.org/W2183811469","https://openalex.org/W4294360851"],"abstract_inverted_index":{"Computing":[0],"shortest":[1,30,76,112],"paths":[2],"and":[3,13,32,78,91,110,114],"distances":[4],"is":[5,102],"one":[6],"of":[7,45,52],"the":[8],"fundamental":[9],"problems":[10],"on":[11,35],"graphs,":[12],"it":[14],"remains":[15],"a":[16,23,43,55,84,103],"challenging":[17],"task":[18],"today.":[19],"This":[20],"article":[21],"investigates":[22],"light-weight":[24],"data":[25],"reduction":[26],"technique":[27,105],"for":[28,74,106],"speeding-up":[29,75,111],"path":[31,77,113],"distance":[33,79,115],"queries":[34],"large":[36,119],"graphs.":[37,120],"To":[38],"do":[39],"this,":[40],"we":[41,82,96],"propose":[42],"notion":[44],"routing":[46,62,69,89],"proxies":[47,70,90],"(or":[48],"simply":[49],"proxies),":[50],"each":[51],"which":[53],"represents":[54],"small":[56],"subgraph,":[57],"referred":[58],"to":[59,87],"as":[60],"deterministic":[61],"areas":[63],"(DRAs).":[64],"We":[65],"first":[66],"show":[67],"that":[68,99],"hold":[71],"good":[72],"properties":[73],"queries.":[80],"Then,":[81],"design":[83],"linear-time":[85],"algorithm":[86],"compute":[88],"their":[92],"corresponding":[93],"DRAs.":[94],"Finally,":[95],"experimentally":[97],"verify":[98],"our":[100],"solution":[101],"general":[104],"reducing":[107],"graph":[108],"sizes":[109],"queries,":[116],"using":[117],"real-life":[118]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}