{"id":"https://openalex.org/W4407953295","doi":"https://doi.org/10.1145/3701551.3703512","title":"A Sublinear Algorithm for Approximate Shortest Paths in Large Networks","display_name":"A Sublinear Algorithm for Approximate Shortest Paths in Large Networks","publication_year":2025,"publication_date":"2025-02-26","ids":{"openalex":"https://openalex.org/W4407953295","doi":"https://doi.org/10.1145/3701551.3703512"},"language":"en","primary_location":{"id":"doi:10.1145/3701551.3703512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3701551.3703512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining","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/A5000055605","display_name":"Sabyasachi Basu","orcid":"https://orcid.org/0000-0001-7183-0296"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sabyasachi Basu","raw_affiliation_strings":["UC Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099137228","display_name":"Nadia K\u014dshima","orcid":"https://orcid.org/0009-0005-2557-6166"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nadia K\u014dshima","raw_affiliation_strings":["Massachusetts Institute of Technology, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Boston, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086741302","display_name":"Talya Eden","orcid":"https://orcid.org/0000-0001-8470-9508"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Talya Eden","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044142637","display_name":"Omri Ben\u2010Eliezer","orcid":"https://orcid.org/0000-0001-6366-5964"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Omri Ben-Eliezer","raw_affiliation_strings":["Technion -- Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion -- Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038687804","display_name":"C. Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555"},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]},{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":["UC Santa Cruz, Santa Cruz, CA, USA & Amazon, Cupertino, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Cruz, Santa Cruz, CA, USA & Amazon, Cupertino, CA, USA","institution_ids":["https://openalex.org/I1311688040","https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5000055605"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04438429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"20","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9972000122070312,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7163594961166382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6669551134109497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4936579167842865},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.491958349943161},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.33824554085731506},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.311947762966156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23927849531173706},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23642465472221375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.047377705574035645}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7163594961166382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6669551134109497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4936579167842865},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.491958349943161},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.33824554085731506},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.311947762966156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23927849531173706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23642465472221375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.047377705574035645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3701551.3703512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3701551.3703512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8961025289","display_name":null,"funder_award_id":"CCF-1740850, CCF-1839317, CCF-2402572, DMS-2023495","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1581228220","https://openalex.org/W1597203970","https://openalex.org/W1821277955","https://openalex.org/W2005945380","https://openalex.org/W2019003829","https://openalex.org/W2020880764","https://openalex.org/W2049500052","https://openalex.org/W2060113596","https://openalex.org/W2068902429","https://openalex.org/W2080617644","https://openalex.org/W2084224084","https://openalex.org/W2112976607","https://openalex.org/W2126708793","https://openalex.org/W2139975838","https://openalex.org/W2144629587","https://openalex.org/W2151021662","https://openalex.org/W2169528473","https://openalex.org/W2244611312","https://openalex.org/W2336754337","https://openalex.org/W2344526012","https://openalex.org/W2461311369","https://openalex.org/W2791658191","https://openalex.org/W2802893379","https://openalex.org/W2912708407","https://openalex.org/W2963318430","https://openalex.org/W2971114155","https://openalex.org/W2990713886","https://openalex.org/W3032387886","https://openalex.org/W3039962484","https://openalex.org/W3085766793","https://openalex.org/W3117650934","https://openalex.org/W3198863884","https://openalex.org/W4213119946","https://openalex.org/W4237492309","https://openalex.org/W4242476948","https://openalex.org/W4312278390","https://openalex.org/W4317036499","https://openalex.org/W6600258945","https://openalex.org/W6601065604","https://openalex.org/W6817014290"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"Computing":[0],"distances":[1],"and":[2,59],"finding":[3],"shortest":[4],"paths":[5],"in":[6,15],"massive":[7],"real-world":[8],"networks":[9],"is":[10,75],"a":[11,61],"fundamental":[12],"algorithmic":[13],"task":[14],"network":[16],"analysis.":[17],"There":[18],"are":[19,30,44,54],"two":[20,83],"main":[21],"approaches":[22],"to":[23,80],"solving":[24],"this":[25],"task.":[26],"On":[27,50],"one":[28],"end":[29,53],"traversal-based":[31],"algorithms":[32],"like":[33],"bidirectional":[34],"breadth-first":[35],"search":[36],"(BiBFS),":[37],"which":[38,57],"have":[39],"no":[40],"preprocessing":[41],"step":[42],"but":[43],"slow":[45],"on":[46],"individual":[47,68],"distance":[48,87],"inquiries.":[49],"the":[51,90],"other":[52],"indexing-based":[55],"approaches,":[56],"create":[58],"maintain":[60],"large":[62],"index.":[63],"This":[64],"allows":[65],"for":[66,92],"answering":[67],"inquiries":[69,88],"very":[70],"fast;":[71],"however,":[72],"index":[73],"creation":[74],"prohibitively":[76],"expensive.":[77],"We":[78],"seek":[79],"bridge":[81],"these":[82],"extremes:":[84],"quickly":[85],"answer":[86],"without":[89],"need":[91],"costly":[93],"preprocessing.":[94]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}