{"id":"https://openalex.org/W2015819397","doi":"https://doi.org/10.1137/s0097539700369740","title":"A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction","display_name":"A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2015819397","doi":"https://doi.org/10.1137/s0097539700369740","mag":"2015819397"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700369740","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700369740","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Weizmann Institute of Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036270957","display_name":"Vitaly Rubinovich","orcid":"https://orcid.org/0000-0001-6292-6915"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vitaly Rubinovich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3487,"has_fulltext":false,"cited_by_count":161,"citation_normalized_percentile":{"value":0.88026558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"30","issue":"5","first_page":"1427","last_page":"1442"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/spanning-tree","display_name":"Spanning tree","score":0.7434102296829224},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7321809530258179},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7196811437606812},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6680356860160828},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6436598300933838},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6271559000015259},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5970034599304199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5907347202301025},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5899187326431274},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5466710329055786},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5089590549468994},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.48486384749412537},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4616796672344208},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4492821991443634},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4388084411621094},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4205958843231201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4151262044906616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.208303302526474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19623920321464539},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1115465760231018},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09908100962638855}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7434102296829224},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7321809530258179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7196811437606812},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6680356860160828},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6436598300933838},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6271559000015259},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5970034599304199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5907347202301025},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5899187326431274},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5466710329055786},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5089590549468994},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.48486384749412537},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4616796672344208},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4492821991443634},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4388084411621094},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4205958843231201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4151262044906616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.208303302526474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19623920321464539},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1115465760231018},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09908100962638855},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539700369740","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700369740","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W2025827262","https://openalex.org/W2053788000","https://openalex.org/W2054910423","https://openalex.org/W2077371116","https://openalex.org/W2163097371"],"related_works":["https://openalex.org/W1143194816","https://openalex.org/W2307044859","https://openalex.org/W2803918337","https://openalex.org/W4380840098","https://openalex.org/W2081066931","https://openalex.org/W2943635264","https://openalex.org/W4224074580","https://openalex.org/W3016811403","https://openalex.org/W4387560073","https://openalex.org/W2069416867"],"abstract_inverted_index":{"This":[0,37],"paper":[1],"presents":[2],"a":[3,19],"lower":[4],"bound":[5],"of":[6,18,28,42],"$\\Omega(D+\\sqrt":[7],"n/\\log":[8],"n)$":[9],"on":[10],"the":[11,15,33,39,48],"time":[12],"required":[13],"for":[14,47],"distributed":[16,45],"construction":[17],"minimum-weight":[20],"spanning":[21],"tree":[22],"(MST)":[23],"in":[24,32],"weighted":[25],"n-vertex":[26],"networks":[27],"diameter":[29],"$D=\\Omega(\\log":[30],"n)$,":[31],"bounded":[34],"message":[35],"model.":[36],"establishes":[38],"asymptotic":[40],"near-optimality":[41],"existing":[43],"time-efficient":[44],"algorithms":[46],"problem,":[49],"whose":[50],"complexity":[51],"is":[52],"$O(D":[53],"+":[54],"\\sqrt":[55],"n":[56],"\\log^*":[57],"n)$.":[58]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}