{"id":"https://openalex.org/W2147045484","doi":"https://doi.org/10.1109/infcom.2011.5934973","title":"Approximate distance queries and compact routing in sparse graphs","display_name":"Approximate distance queries and compact routing in sparse graphs","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2147045484","doi":"https://doi.org/10.1109/infcom.2011.5934973","mag":"2147045484"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5934973","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934973","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1273537","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101589780","display_name":"Rachit Agarwal","orcid":"https://orcid.org/0000-0001-7971-3246"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rachit Agarwal","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, USA","University of Illinois at Urbana\u2013Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana\u2013Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066308539","display_name":"P. Brighten Godfrey","orcid":"https://orcid.org/0009-0003-2930-1982"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Brighten Godfrey","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, USA","University of Illinois at Urbana\u2013Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana\u2013Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, USA","University of Illinois at Urbana\u2013Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana\u2013Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":6.5831,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.96918605,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1754","last_page":"1762"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9944999814033508,"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/combinatorics","display_name":"Combinatorics","score":0.6186760067939758},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.510120689868927},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4857528805732727},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43318116664886475},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42599207162857056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4172404110431671},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41291987895965576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3627471923828125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.331768274307251},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10182809829711914}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6186760067939758},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.510120689868927},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4857528805732727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43318116664886475},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42599207162857056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4172404110431671},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41291987895965576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3627471923828125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.331768274307251},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10182809829711914},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/infcom.2011.5934973","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934973","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.6217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.6217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/%7Epbg/papers/compact_routing_in_sparse_graphs.pdf","raw_type":"text"},{"id":"pmh:oai:zenodo.org:1273537","is_oa":true,"landing_page_url":"https://zenodo.org/record/1273537","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1273537","is_oa":true,"landing_page_url":"https://zenodo.org/record/1273537","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1527483699","https://openalex.org/W1564473842","https://openalex.org/W1656048259","https://openalex.org/W1968698408","https://openalex.org/W1982100216","https://openalex.org/W1997881834","https://openalex.org/W2045446569","https://openalex.org/W2057994027","https://openalex.org/W2065889189","https://openalex.org/W2105047865","https://openalex.org/W2107527903","https://openalex.org/W2108166877","https://openalex.org/W2121761994","https://openalex.org/W2132877272","https://openalex.org/W2133065816","https://openalex.org/W2147391892","https://openalex.org/W2147688841","https://openalex.org/W2172107427","https://openalex.org/W6631222323","https://openalex.org/W6636804184","https://openalex.org/W6664927380","https://openalex.org/W7062468297"],"related_works":["https://openalex.org/W2399035783","https://openalex.org/W3161230432","https://openalex.org/W4367190712","https://openalex.org/W2168900540","https://openalex.org/W1487201914","https://openalex.org/W4301429470","https://openalex.org/W280458463","https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2005304136"],"abstract_inverted_index":{"An":[0],"approximate":[1,18],"distance":[2],"query":[3,90,105,153],"data":[4,28,73,127],"structure":[5,29],"is":[6],"a":[7,11,116,181],"compact":[8,183],"representation":[9],"of":[10,24,47,88,115,125,151],"graph,":[12,166],"and":[13,103,140,176],"can":[14],"be":[15,174],"queried":[16],"to":[17,178],"shortest":[19],"paths":[20,36,132,143],"between":[21],"any":[22],"pair":[23],"vertices.":[25],"Any":[26],"such":[27],"that":[30,53,81,169],"retrieves":[31],"stretch":[32,108,130,141],"2k":[33],"\u03a9":[34],"1":[35],"must":[37],"require":[38,96],"space":[39,102,139],"\u03a9(n":[40,66],"<sup":[41,67,98,135],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[42,68,99,136],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1+1/k</sup>":[43],")":[44,101,138],"for":[45,76,107],"graphs":[46,62,95,161],"n":[48],"nodes.":[49],"The":[50],"hard":[51],"cases":[52,124],"enforce":[54],"this":[55],"lower":[56,82],"bound":[57,83],"are,":[58],"however,":[59],"rather":[60],"dense":[61],"with":[63,118,133,144],"average":[64,119],"degree":[65,120],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1/k</sup>":[69],").":[70],"We":[71],"present":[72],"structures":[74,128],"that,":[75],"sparse":[77],"graphs,":[78],"substantially":[79],"break":[80],"barrier":[84],"at":[85,148],"the":[86,112,149,163],"expense":[87],"higher":[89],"time.":[91,154],"For":[92,111],"instance,":[93],"general":[94],"O(n":[97,134],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3/2</sup>":[100,137],"constant":[104],"time":[106],"3":[109,142],"paths.":[110],"realistic":[113],"scenario":[114],"graph":[117],"\u0398(log":[121],"n),":[122],"special":[123],"our":[126,170],"retrieve":[129],"2":[131],"O\u0305(n)":[145],"space,":[146],"albeit":[147],"cost":[150],"O\u0305(\u221an)":[152],"Moreover,":[155],"supported":[156],"by":[157],"large-scale":[158],"simulations":[159],"on":[160],"including":[162],"AS-level":[164],"Internet":[165],"we":[167],"argue":[168],"stretch-2":[171],"scheme":[172],"would":[173],"simple":[175],"efficient":[177],"implement":[179],"as":[180],"distributed":[182],"routing":[184],"protocol.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}