分布式MST构造时间复杂度的近紧下界

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI:10.1109/SFFCS.1999.814597

D. Peleg, Vitaly Rubinovich

{"title":"分布式MST构造时间复杂度的近紧下界","authors":"D. Peleg, Vitaly Rubinovich","doi":"10.1109/SFFCS.1999.814597","DOIUrl":null,"url":null,"abstract":"This paper presents a lower bound of /spl Omega/~(D+/spl radic/n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D=/spl Omega/(log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D+/spl radic/nlog* n).","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"98","resultStr":"{\"title\":\"A near-tight lower bound on the time complexity of distributed MST construction\",\"authors\":\"D. Peleg, Vitaly Rubinovich\",\"doi\":\"10.1109/SFFCS.1999.814597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a lower bound of /spl Omega/~(D+/spl radic/n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D=/spl Omega/(log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D+/spl radic/nlog* n).\",\"PeriodicalId\":385047,\"journal\":{\"name\":\"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"98\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFFCS.1999.814597\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFFCS.1999.814597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 98

摘要

本文给出了在有界消息模型中，直径为D=/spl Omega/(log n)的n顶点网络中分布式构造最小权值生成树所需时间的下界/spl Omega/~(D+/spl radial /n)。对于复杂度为O(D+/spl radial /nlog* n)的问题，建立了现有的时效性分布式算法的渐近近最优性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A near-tight lower bound on the time complexity of distributed MST construction

This paper presents a lower bound of /spl Omega/~(D+/spl radic/n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D=/spl Omega/(log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D+/spl radic/nlog* n).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)

自引率

0.00%

发文量