{"id":"https://openalex.org/W2962821186","doi":"https://doi.org/10.1145/3293611.3331604","title":"Distributed Minimum Degree Spanning Trees","display_name":"Distributed Minimum Degree Spanning Trees","publication_year":2019,"publication_date":"2019-07-16","ids":{"openalex":"https://openalex.org/W2962821186","doi":"https://doi.org/10.1145/3293611.3331604","mag":"2962821186"},"language":"en","primary_location":{"id":"doi:10.1145/3293611.3331604","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331604","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331604","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed 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/3293611.3331604","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019056248","display_name":"Magn\u00fas M. Halld\u00f3rsson","orcid":"https://orcid.org/0000-0002-5774-8437"},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":false,"raw_author_name":"Magnus M. Halldorsson","raw_affiliation_strings":["Reykjavik University, Reykjavik, Iceland"],"affiliations":[{"raw_affiliation_string":"Reykjavik University, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101050681","display_name":"Taisuke Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taisuke Izumi","raw_affiliation_strings":["Nagoya Institute of Technology, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Nagoya, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078649776","display_name":"Calvin Newport","orcid":"https://orcid.org/0009-0006-0353-8254"},"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":false,"raw_author_name":"Calvin Newport","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63186454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"511","last_page":"520"},"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.9998000264167786,"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.9998000264167786,"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.9979000091552734,"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/T10237","display_name":"Cryptography and Data Security","score":0.9958999752998352,"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/spanning-tree","display_name":"Spanning tree","score":0.7784987688064575},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6872144341468811},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6729207038879395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6464216113090515},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5362901091575623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49069392681121826},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4499918520450592},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4378209114074707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35566213726997375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3417586088180542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26352110505104065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24155035614967346},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.16014376282691956},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07395672798156738}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7784987688064575},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6872144341468811},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6729207038879395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6464216113090515},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5362901091575623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49069392681121826},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4499918520450592},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4378209114074707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35566213726997375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3417586088180542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26352110505104065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24155035614967346},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.16014376282691956},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07395672798156738},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3293611.3331604","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331604","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331604","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3293611.3331604","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331604","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331604","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2023907072","display_name":null,"funder_award_id":"SICORP","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"},{"id":"https://openalex.org/G2910927634","display_name":null,"funder_award_id":"16H02878,19K11824","funder_id":"https://openalex.org/F4320320212","funder_display_name":"Japan Society for the Promotion of Science London"},{"id":"https://openalex.org/G6387499725","display_name":null,"funder_award_id":"7773087, 1535887","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"},{"id":"https://openalex.org/F4320320212","display_name":"Japan Society for the Promotion of Science London","ror":"https://ror.org/02m7axw05"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962821186.pdf","grobid_xml":"https://content.openalex.org/works/W2962821186.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1007786830","https://openalex.org/W1530297000","https://openalex.org/W1540674943","https://openalex.org/W1975151150","https://openalex.org/W2005900781","https://openalex.org/W2015819397","https://openalex.org/W2035974827","https://openalex.org/W2053050060","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2054823807","https://openalex.org/W2066700938","https://openalex.org/W2071346873","https://openalex.org/W2074417667","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2100466311","https://openalex.org/W2163097371","https://openalex.org/W2172178473","https://openalex.org/W2612518566","https://openalex.org/W2748046883","https://openalex.org/W2927492090","https://openalex.org/W2963738383"],"related_works":["https://openalex.org/W2157421865","https://openalex.org/W2114421280","https://openalex.org/W2684541573","https://openalex.org/W2963420932","https://openalex.org/W2159156348","https://openalex.org/W2172178473","https://openalex.org/W2135993528","https://openalex.org/W2063807274","https://openalex.org/W2004163233","https://openalex.org/W2100812758"],"abstract_inverted_index":{"The":[0],"minimum":[1],"degree":[2,22,39,65,115,176],"spanning":[3,12,30,61],"tree":[4,13,62],"(MDST)":[5],"problem":[6,57,133],"requires":[7,180,188],"the":[8,20,26,55,75,86,92,98,110,122,131,138,142,153,204],"construction":[9],"of":[10,23,32,206],"a":[11,41,49,60,162,174],"T":[14,24],"for":[15,40,54,130],"graph":[16,93,99],"G,":[17],"such":[18],"that":[19,58,165,167,172],"maximum":[21,64,175],"is":[25,91,97,148],"smallest":[27],"among":[28],"all":[29],"trees":[31],"G.":[33],"Let":[34],"d":[35],"be":[36,199],"this":[37,45,107],"MDST":[38,56,132,170],"given":[42],"graph.":[43],"In":[44],"paper,":[46],"we":[47],"present":[48],"randomized":[50,169,210],"distributed":[51,156],"approximation":[52,128],"algorithm":[53,76,171,197],"constructs":[59],"with":[63],"in":[66,73,78,85,137,177],"O(d+log":[67],"n":[68,96],").":[69],"With":[70],"high":[71],"probability":[72],"n,":[74],"runs":[77],"O((D":[79],"+":[80],"\u221an)":[81],"log4":[82],"n)":[83],"rounds,":[84,183],"broadcast-CONGEST":[87],"model,":[88],"where":[89],"D":[90],"diameter":[94],"and":[95,116,184,202],"size.":[100],"We":[101,158],"then":[102],"show":[103],"how":[104],"to":[105,198],"derandomize":[106],"algorithm,":[108],"obtaining":[109],"same":[111],"asymptotic":[112],"guarantees":[113,173],"on":[114],"time":[117],"complexity,":[118],"but":[119],"now":[120],"requiring":[121],"standard":[123],"CONGEST":[124],"model.":[125],"Although":[126],"efficient":[127,155,209],"algorithms":[129,151],"have":[134],"been":[135],"known":[136],"sequential":[139],"setting":[140],"since":[141],"1990's":[143],"(finding":[144],"an":[145],"exact":[146],"solution":[147,187],"NP-hard),":[149],"our":[150,195],"are":[152],"first":[154],"solutions.":[157,211],"conclude":[159],"by":[160],"proving":[161],"lower":[163],"bound":[164],"establishes":[166],"any":[168,185],"\u223c\u03a9":[178,189],"(d)":[179],"&\u00d8#8764;\u03a9":[181],"(n1/3)":[182],"deterministic":[186,196],"(n1/2)":[190],"rounds.":[191],"These":[192],"bounds":[193],"proves":[194],"asymptotically":[200],"optimal,":[201],"eliminates":[203],"possibility":[205],"significantly":[207],"more":[208]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}