{"id":"https://openalex.org/W4365211604","doi":"https://doi.org/10.4230/lipics.esa.2023.72","title":"Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths","display_name":"Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4365211604","doi":"https://doi.org/10.4230/lipics.esa.2023.72"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2304.05279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2304.05279","pdf_url":"https://arxiv.org/pdf/2304.05279","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2304.05279","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kociumaka, Tomasz","orcid":"https://orcid.org/0000-0002-2477-1702"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kociumaka, Tomasz","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2477-1702","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030781741","display_name":"Alejandro Cassis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Polak, Adam","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4925-774X","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62472914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9918000102043152,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7677804827690125},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6439931392669678},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5890929698944092},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5340192914009094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5095275044441223},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5066388249397278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4962325692176819},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4821128845214844},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.47448018193244934},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4733548164367676},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4696680009365082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40301513671875},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.36630722880363464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3617281913757324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3542044162750244},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2511100172996521},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06453225016593933}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7677804827690125},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6439931392669678},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5890929698944092},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5340192914009094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5095275044441223},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5066388249397278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4962325692176819},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4821128845214844},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.47448018193244934},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4733548164367676},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4696680009365082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40301513671875},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.36630722880363464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3617281913757324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3542044162750244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2511100172996521},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06453225016593933},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2304.05279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2304.05279","pdf_url":"https://arxiv.org/pdf/2304.05279","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18725","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.72","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol274-esa2023/LIPIcs.ESA.2023.72/LIPIcs.ESA.2023.72.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2304.05279","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2304.05279","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.esa.2023.72","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2023.72","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2304.05279","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2304.05279","pdf_url":"https://arxiv.org/pdf/2304.05279","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2608529560","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3606372325","display_name":null,"funder_award_id":"CRFS-2_207365","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G6024400613","display_name":"Investigating the Conjectures of Fine-Grained Complexity","funder_award_id":"101078482","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6475570109","display_name":null,"funder_award_id":"185030","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"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/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320323322","display_name":"Universit\u00e4t des Saarlandes","ror":"https://ror.org/01jdpyv68"},{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4365211604.pdf","grobid_xml":"https://content.openalex.org/works/W4365211604.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W1581210843","https://openalex.org/W2018076478","https://openalex.org/W1982530285","https://openalex.org/W1529390395","https://openalex.org/W2611723985","https://openalex.org/W1838063489","https://openalex.org/W1830048115","https://openalex.org/W2126169066"],"abstract_inverted_index":{"In":[0,50],"this":[1,51],"work":[2,52],"we":[3,53,100,118],"revisit":[4],"the":[5,43,46,55,82,124,129],"fundamental":[6],"Single-Source":[7],"Shortest":[8],"Paths":[9],"(SSSP)":[10],"problem":[11],"with":[12,112],"possibly":[13],"negative":[14,98],"edge":[15],"weights.":[16],"A":[17],"recent":[18],"breakthrough":[19],"result":[20],"by":[21,68],"Bernstein,":[22],"Nanongkai":[23],"and":[24,109],"Wulff-Nilsen":[25],"established":[26],"a":[27,136],"near-linear":[28],"$O(m":[29,59],"\\log^8(n)":[30],"\\log(W))$-time":[31],"algorithm":[32,103,121],"for":[33,139],"negative-weight":[34,48],"SSSP,":[35],"where":[36],"$W$":[37],"is":[38,65],"an":[39,66,102,120],"upper":[40],"bound":[41],"on":[42],"magnitude":[44],"of":[45,73,105],"smallest":[47],"edge.":[49],"improve":[54],"running":[56,131],"time":[57,132],"to":[58,78,96,122],"\\log^2(n)":[60],"\\log(nW)":[61],"\\log\\log":[62],"n)$,":[63],"which":[64],"improvement":[67],"nearly":[69],"six":[70],"log-factors.":[71],"Some":[72],"these":[74],"log-factors":[75],"are":[76,91],"easy":[77],"shave":[79],"(e.g.":[80,95],"replacing":[81],"priority":[83],"queue":[84],"used":[85],"in":[86,128,143],"Dijkstra's":[87],"algorithm),":[88],"while":[89],"others":[90],"significantly":[92],"more":[93],"involved":[94],"find":[97],"cycles":[99],"design":[101],"reminiscent":[104],"noisy":[106],"binary":[107],"search":[108],"analyze":[110],"it":[111],"drift":[113],"analysis).":[114],"As":[115],"side":[116],"results,":[117],"obtain":[119],"compute":[123],"minimum":[125],"cycle":[126],"mean":[127],"same":[130],"as":[133,135],"well":[134],"new":[137],"construction":[138],"computing":[140],"Low-Diameter":[141],"Decompositions":[142],"directed":[144],"graphs.":[145]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-04T08:30:34.212998","created_date":"2023-04-13T00:00:00"}