{"id":"https://openalex.org/W3155775554","doi":"https://doi.org/10.1145/3442381.3450083","title":"Sketch-based Algorithms for Approximate Shortest Paths in Road Networks","display_name":"Sketch-based Algorithms for Approximate Shortest Paths in Road Networks","publication_year":2021,"publication_date":"2021-04-19","ids":{"openalex":"https://openalex.org/W3155775554","doi":"https://doi.org/10.1145/3442381.3450083","mag":"3155775554"},"language":"en","primary_location":{"id":"doi:10.1145/3442381.3450083","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442381.3450083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Web Conference 2021","raw_type":"proceedings-article"},"type":"conference-paper","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/A5072297118","display_name":"Gaurav Aggarwal","orcid":"https://orcid.org/0000-0003-2261-1657"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gaurav Aggarwal","raw_affiliation_strings":["Google, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039201046","display_name":"Sreenivas Gollapudi","orcid":"https://orcid.org/0000-0002-5732-3164"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sreenivas Gollapudi","raw_affiliation_strings":["Google, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097818052","display_name":"Raghavender","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raghavender","raw_affiliation_strings":["Google, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086919065","display_name":"Ali Kemal Sinop","orcid":"https://orcid.org/0000-0001-6550-6027"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Kemal Sinop","raw_affiliation_strings":["Google, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Turkey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":null,"first_page":"3918","last_page":"3929"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9919999837875366,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9908000230789185,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7768392562866211},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7619531750679016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6326684951782227},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5922132134437561},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5459722876548767},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5453450679779053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.500868558883667},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.467398464679718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4429701566696167},{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.4298986494541168},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.42587149143218994},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4247640371322632},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4072502851486206},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.22195783257484436}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7768392562866211},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7619531750679016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6326684951782227},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5922132134437561},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5459722876548767},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5453450679779053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.500868558883667},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.467398464679718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4429701566696167},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.4298986494541168},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.42587149143218994},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4247640371322632},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4072502851486206},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22195783257484436},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3442381.3450083","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442381.3450083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Web Conference 2021","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1779869868","https://openalex.org/W1842953391","https://openalex.org/W1969483458","https://openalex.org/W1977943748","https://openalex.org/W1984336731","https://openalex.org/W2034331023","https://openalex.org/W2045446569","https://openalex.org/W2045756072","https://openalex.org/W2070232376","https://openalex.org/W2071717275","https://openalex.org/W2098636939","https://openalex.org/W2108166877","https://openalex.org/W2135512436","https://openalex.org/W2140271346","https://openalex.org/W2153374077","https://openalex.org/W2159394589","https://openalex.org/W2163857115","https://openalex.org/W2256374442","https://openalex.org/W2571366332","https://openalex.org/W2613189058","https://openalex.org/W3009233884","https://openalex.org/W3031952539","https://openalex.org/W4210727445","https://openalex.org/W4212995338","https://openalex.org/W4238612308"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2597144308","https://openalex.org/W2391130892","https://openalex.org/W1617152041","https://openalex.org/W2347245430","https://openalex.org/W2368964068","https://openalex.org/W2354846196","https://openalex.org/W2100214387","https://openalex.org/W4307561361"],"abstract_inverted_index":{"Constructing":[0],"efficient":[1,37],"data":[2],"structures":[3],"(distance":[4],"oracles)":[5],"for":[6,44],"fast":[7],"computation":[8],"of":[9,23,66,77,87,97,104,125,140,179],"shortest":[10,47,114,153],"paths":[11,48,51,115],"and":[12,49,116,177],"other":[13,73],"connectivity":[14],"measures":[15],"in":[16,25,52,69,81,149],"graphs":[17],"has":[18,121],"been":[19],"a":[20,41,58,78,82,85,94],"promising":[21],"area":[22],"study":[24],"computer":[26],"science":[27],"[23,":[28],"24,":[29],"28].":[30],"In":[31,72],"this":[32],"paper,":[33],"we":[34,56,156],"propose":[35],"very":[36],"algorithms,":[38],"based":[39],"on":[40],"distance":[42,59,142],"oracle,":[43],"computing":[45],"approximate":[46],"alternate":[50],"road":[53],"networks.":[54,71],"Specifically,":[55],"adopt":[57],"oracle":[60,143],"construction":[61],"that":[62,118,159],"exploits":[63],"the":[64,75,88,102,122,138,152],"existence":[65,76],"small":[67,79,95],"separators":[68],"such":[70,131,174],"words,":[74],"cut":[80],"graph":[83,89],"admits":[84],"partitioning":[86],"into":[90],"balanced":[91],"components":[92],"with":[93,170],"number":[96],"inter-component":[98],"edges.":[99],"We":[100,135],"demonstrate":[101,137,158],"efficacy":[103],"our":[105,141,160],"algorithm":[106],"by":[107],"using":[108],"it":[109,119],"to":[110,144,151,172],"find":[111],"near":[112],"optimal":[113],"show":[117],"also":[120],"desired":[123],"properties":[124],"well-studied":[126],"goal-oriented":[127],"path":[128],"search":[129],"algorithms":[130],"as":[132,175],"ALT":[133],"[12].":[134],"further":[136],"use":[139],"produce":[145],"multiple":[146],"alternative":[147],"routes":[148],"addition":[150],"path.":[154],"Finally,":[155],"empirically":[157],"method,":[161],"while":[162],"exploring":[163],"few":[164],"edges,":[165],"produces":[166],"high":[167],"quality":[168],"alternates":[169],"respect":[171],"metrics":[173],"optimality-loss":[176],"diversity":[178],"paths.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}