{"id":"https://openalex.org/W3034281291","doi":"https://doi.org/10.1145/3357713.3384270","title":"Efficient construction of directed hopsets and parallel approximate shortest paths","display_name":"Efficient construction of directed hopsets and parallel approximate shortest paths","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034281291","doi":"https://doi.org/10.1145/3357713.3384270","mag":"3034281291"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","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/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Georgetown University, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022670058","display_name":"Katina Russell","orcid":"https://orcid.org/0009-0005-6230-8427"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katina Russell","raw_affiliation_strings":["Georgetown University, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030710270"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":1.5479,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86704487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"336","last_page":"349"},"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.9997000098228455,"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.9997000098228455,"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.9958999752998352,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7878144979476929},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6367257833480835},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6225552558898926},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6112222075462341},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5886427164077759},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5781144499778748},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5475013852119446},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5373436808586121},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5304927825927734},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5099185705184937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49662357568740845},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4933907091617584},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4175442159175873},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.41565054655075073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3708195090293884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35757869482040405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34365445375442505}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7878144979476929},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6367257833480835},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6225552558898926},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6112222075462341},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5886427164077759},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5781144499778748},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5475013852119446},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5373436808586121},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5304927825927734},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5099185705184937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49662357568740845},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4933907091617584},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4175442159175873},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.41565054655075073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3708195090293884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35757869482040405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34365445375442505},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1999123717","https://openalex.org/W2003969379","https://openalex.org/W2044112344","https://openalex.org/W2056496054","https://openalex.org/W2063301486","https://openalex.org/W2084224084","https://openalex.org/W2269957429","https://openalex.org/W2752885492","https://openalex.org/W2788498659","https://openalex.org/W2945481216","https://openalex.org/W2951926403","https://openalex.org/W2963618817","https://openalex.org/W2964070308","https://openalex.org/W3034415339","https://openalex.org/W3034903651"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2237480599","https://openalex.org/W4293054712","https://openalex.org/W2133099431","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2040572217","https://openalex.org/W1504745067","https://openalex.org/W2002764510","https://openalex.org/W2950984363"],"abstract_inverted_index":{"The":[0],"approximate":[1,63],"single-source":[2],"shortest-path":[3,64],"problem":[4,65],"is":[5],"as":[6],"follows:":[7],"given":[8],"a":[9,16],"graph":[10],"with":[11,55],"nonnegative":[12],"edge":[13,75],"weights":[14],"and":[15,41,73,82],"designated":[17],"source":[18],"vertex":[19,31],"s,":[20],"return":[21],"estimates":[22],"of":[23,94,99],"the":[24,34,38,44,49,62,92,100,106],"distances":[25],"from":[26],"s":[27],"to":[28,103,105],"each":[29],"other":[30],"such":[32],"that":[33],"estimate":[35],"falls":[36],"between":[37],"true":[39],"distance":[40],"(1+\u0454)":[42],"times":[43],"distance.":[45],"This":[46],"paper":[47],"provides":[48],"first":[50],"nearly":[51],"work-efficient":[52],"parallel":[53],"algorithm":[54,78],"sublinear":[56],"span":[57,83],"(also":[58],"called":[59],"depth)":[60],"for":[61,70,91],"on":[66],"directed":[67,107],"graphs.":[68],"Specifically,":[69],"constant":[71],"\u0454":[72],"polynomially-bounded":[74],"weights,":[76],"our":[77],"has":[79],"work":[80],"\u00d5(m)":[81],"n":[84],"1/2+o(1).":[85],"Several":[86],"algorithms":[87],"were":[88],"previously":[89],"known":[90],"case":[93],"undirected":[95],"graphs,":[96],"but":[97],"none":[98],"techniques":[101],"seem":[102],"translate":[104],"setting.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}