{"id":"https://openalex.org/W4399523344","doi":"https://doi.org/10.1145/3618260.3649614","title":"Single-Source Shortest Paths with Negative Real Weights in <i> \u00d5(\ud835\udc5a\ud835\udc5b <sup>8/9</sup> ) </i> Time","display_name":"Single-Source Shortest Paths with Negative Real Weights in <i> \u00d5(\ud835\udc5a\ud835\udc5b <sup>8/9</sup> ) </i> Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523344","doi":"https://doi.org/10.1145/3618260.3649614"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649614","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649614","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649614","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649614","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, WASHINGTON, USA"],"raw_orcid":"https://orcid.org/0009-0000-7483-4532","affiliations":[{"raw_affiliation_string":"Georgetown University, WASHINGTON, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011772692"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":1.6055,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84694005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"14"},"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.9998999834060669,"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.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9984999895095825,"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.6242411732673645},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5319911241531372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45919477939605713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43947625160217285},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43678978085517883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4308939278125763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42895299196243286},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41426926851272583},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4116152226924896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4065554738044739},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.37264811992645264},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1187099814414978}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6242411732673645},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5319911241531372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45919477939605713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43947625160217285},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43678978085517883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4308939278125763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42895299196243286},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41426926851272583},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4116152226924896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4065554738044739},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.37264811992645264},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1187099814414978}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649614","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649614","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649614","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649614","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649614","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649614","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1276241304","display_name":null,"funder_award_id":"CCF-2106759","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7681175234","display_name":null,"funder_award_id":"CCF-1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051948103","display_name":"SPX: Automatically Parallelizing Approximate Data Analysis with Mergeable Summaries","funder_award_id":"1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523344.pdf","grobid_xml":"https://content.openalex.org/works/W4399523344.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1969357318","https://openalex.org/W2022980325","https://openalex.org/W2065105907","https://openalex.org/W2084224084","https://openalex.org/W2084364487","https://openalex.org/W2164141517","https://openalex.org/W2752885492","https://openalex.org/W3126680358","https://openalex.org/W3128545493","https://openalex.org/W3129191225","https://openalex.org/W4249075686","https://openalex.org/W4313203312","https://openalex.org/W4313227229","https://openalex.org/W4390097958","https://openalex.org/W4390098284","https://openalex.org/W4390575961"],"related_works":["https://openalex.org/W2578319993","https://openalex.org/W4223969905","https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W2359532380","https://openalex.org/W2379804627","https://openalex.org/W2373384475","https://openalex.org/W4221129498","https://openalex.org/W2375661673","https://openalex.org/W2363342665"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"randomized":[4],"algorithm":[5,32,54],"for":[6],"single-source":[7],"shortest":[8],"paths":[9],"on":[10],"directed":[11],"graphs":[12],"with":[13,25,37],"real":[14],"(both":[15],"positive":[16],"and":[17,28,61],"negative)":[18],"edge":[19],"weights.":[20],"Given":[21],"an":[22],"input":[23],"graph":[24],"n":[26],"vertices":[27],"m":[29],"edges,":[30],"the":[31,46,51],"completes":[33],"in":[34],"\u00d5(mn8/9)":[35],"time":[36],"high":[38],"probability.":[39],"For":[40],"real-weighted":[41],"graphs,":[42],"this":[43],"result":[44],"constitutes":[45],"first":[47],"asymptotic":[48],"improvement":[49],"over":[50],"classic":[52],"O(mn)-time":[53],"variously":[55],"attributed":[56],"to":[57],"Shimbel,":[58],"Bellman,":[59],"Ford,":[60],"Moore.":[62]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3}],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2025-10-10T00:00:00"}