{"id":"https://openalex.org/W4226310359","doi":"https://doi.org/10.48550/arxiv.2203.03456","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","display_name":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","publication_year":2022,"publication_date":"2022-03-07","ids":{"openalex":"https://openalex.org/W4226310359","doi":"https://doi.org/10.48550/arxiv.2203.03456"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2203.03456","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2203.03456","pdf_url":"https://arxiv.org/pdf/2203.03456","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2203.03456","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054889143","display_name":"Aaron Bernstein","orcid":"https://orcid.org/0000-0002-7599-2679"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bernstein, Aaron","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nanongkai, Danupon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wulff-Nilsen, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054889143"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9973000288009644,"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.9973000288009644,"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.9713000059127808,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9713000059127808,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7099865674972534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6332622766494751},{"id":"https://openalex.org/keywords/tilde","display_name":"Tilde","score":0.5709313750267029},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5611652731895447},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5279504656791687},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47829848527908325},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.47435462474823},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46717625856399536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44981130957603455},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43668702244758606},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4100443720817566},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3988252878189087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3012749254703522}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7099865674972534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6332622766494751},{"id":"https://openalex.org/C36686422","wikidata":"https://www.wikidata.org/wiki/Q11167","display_name":"Tilde","level":2,"score":0.5709313750267029},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5611652731895447},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5279504656791687},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47829848527908325},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.47435462474823},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46717625856399536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44981130957603455},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43668702244758606},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4100443720817566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3988252878189087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3012749254703522},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2203.03456","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2203.03456","pdf_url":"https://arxiv.org/pdf/2203.03456","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2203.03456","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2203.03456","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2203.03456","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2203.03456","pdf_url":"https://arxiv.org/pdf/2203.03456","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1836977259","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1890725643","display_name":null,"funder_award_id":"2019-05622","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7371944007","display_name":null,"funder_award_id":"1942010","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226310359.pdf","grobid_xml":"https://content.openalex.org/works/W4226310359.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2565865680","https://openalex.org/W1508924483","https://openalex.org/W2779121958","https://openalex.org/W2492498253","https://openalex.org/W2407321536","https://openalex.org/W2053924317","https://openalex.org/W2050001863","https://openalex.org/W2883642199","https://openalex.org/W2083026540","https://openalex.org/W4299725383"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,88],"randomized":[3],"algorithm":[4,82,103],"that":[5,71],"computes":[6],"single-source":[7],"shortest":[8],"paths":[9],"(SSSP)":[10],"in":[11],"$O(m\\log^8(n)\\log":[12],"W)$":[13,38,114],"time":[14,47],"when":[15],"edge":[16],"weights":[17],"are":[18,35],"integral":[19],"and":[20,41,62,78,92,122],"can":[21],"be":[22],"negative.":[23],"This":[24],"essentially":[25],"resolves":[26],"the":[27,54,100,110],"classic":[28,111],"negative-weight":[29,105],"SSSP":[30,106],"problem.":[31],"The":[32],"previous":[33],"bounds":[34],"$\\tilde":[36,112],"O((m+n^{1.5})\\log":[37],"[BLNPSSSW":[39],"FOCS'20]":[40],"$m^{4/3+o(1)}\\log":[42],"W$":[43],"[AMV":[44],"FOCS'20].":[45],"Near-linear":[46],"algorithms":[48],"were":[49],"known":[50],"previously":[51],"only":[52,87],"for":[53,104],"special":[55],"case":[56],"of":[57],"planar":[58],"directed":[59],"graphs":[60],"[Fakcharoenphol":[61],"Rao":[63],"FOCS'01].":[64],"In":[65,96],"contrast":[66],"to":[67,107],"all":[68],"recent":[69],"developments":[70],"rely":[72],"on":[73],"sophisticated":[74],"continuous":[75],"optimization":[76],"methods":[77],"dynamic":[79],"algorithms,":[80],"our":[81],"is":[83,99],"simple:":[84],"it":[85],"requires":[86],"simple":[89],"graph":[90],"decomposition":[91],"elementary":[93],"combinatorial":[94,102],"tools.":[95],"fact,":[97],"ours":[98],"first":[101],"break":[108],"through":[109],"O(m\\sqrt{n}\\log":[113],"bound":[115],"from":[116],"over":[117],"three":[118],"decades":[119],"ago":[120],"[Gabow":[121],"Tarjan":[123],"SICOMP'89].":[124]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2025-10-10T00:00:00"}