{"id":"https://openalex.org/W2535457395","doi":"https://doi.org/10.1109/allerton.2008.4797655","title":"s-t paths using the min-sum algorithm","display_name":"s-t paths using the min-sum algorithm","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2535457395","doi":"https://doi.org/10.1109/allerton.2008.4797655","mag":"2535457395"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2008.4797655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and 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/A5017484756","display_name":"Nicholas Ruozzi","orcid":"https://orcid.org/0000-0002-4262-2698"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Ruozzi","raw_affiliation_strings":["Computer Science, Yale University, New Heaven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072765803","display_name":"Sekhar Tatikonda","orcid":"https://orcid.org/0000-0002-8956-6208"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sekhar Tatikonda","raw_affiliation_strings":["Electrical Engineering, Yale University, New Heaven, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.8276,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.78225562,"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":"918","last_page":"921"},"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.9976999759674072,"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.9976999759674072,"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.996999979019165,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8201664686203003},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.622758686542511},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5994583368301392},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5947170257568359},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5925118923187256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5710675716400146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5291939973831177},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5062131285667419},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4959660470485687},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.49096301198005676},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.48167335987091064},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4509144425392151},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.44626399874687195},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.43660303950309753},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4126521944999695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4001311659812927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3982062339782715},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.37085264921188354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29331690073013306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27385443449020386},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.16370126605033875},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06729820370674133}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8201664686203003},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.622758686542511},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5994583368301392},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5947170257568359},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5925118923187256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710675716400146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5291939973831177},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5062131285667419},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4959660470485687},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.49096301198005676},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.48167335987091064},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4509144425392151},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.44626399874687195},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.43660303950309753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4126521944999695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4001311659812927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3982062339782715},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.37085264921188354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29331690073013306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27385443449020386},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.16370126605033875},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06729820370674133},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2008.4797655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.3255","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.3255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs-www.cs.yale.edu/homes/nruozzi/Papers/minsumsp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W276224435","https://openalex.org/W1648500155","https://openalex.org/W1963547452","https://openalex.org/W2099091355","https://openalex.org/W2170987079","https://openalex.org/W3106189858","https://openalex.org/W6674884877"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2365712669","https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2161960576","https://openalex.org/W2020255949","https://openalex.org/W2371371223","https://openalex.org/W2144050074"],"abstract_inverted_index":{"Solving":[0],"the":[1,10,25,33,47,53,59,62,68,73],"distributed":[2,13,49],"shortest":[3,34,50],"path":[4,35,51,64],"problem":[5],"has":[6],"important":[7],"applications":[8],"in":[9,39,72],"theory":[11],"of":[12,27,55,61,70],"systems,":[14],"most":[15],"notably":[16],"routing.":[17],"In":[18],"this":[19],"paper,":[20],"we":[21],"provide":[22],"and":[23,65],"prove":[24],"convergence":[26,56],"a":[28,40],"min-sum":[29],"algorithm":[30],"to":[31],"compute":[32],"between":[36],"two":[37],"nodes":[38,71],"graph":[41],"with":[42],"positive":[43],"edge":[44],"weights.":[45],"Unlike":[46],"standard":[48],"algorithms,":[52],"rate":[54],"depends":[57],"on":[58],"weight":[60],"minimal":[63],"not":[66],"necessarily":[67],"number":[69],"network.":[74]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}