- 1、本文档共17页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
a simple randomized scheme for constructing low-weight strongkstrong
A Simple Randomized Scheme for Constructing
Low-Weight -Connected Spanning Subgraphs with
Applications to Distributed Algorithms
Maleq Khan Gopal Pandurangan V.S. Anil Kumar
Abstract
The main focus of this paper is the analysis of a simple randomized scheme for construct-
ing low-weight -connected spanning subgraphs. We first show that our scheme gives a simple
approximation algorithm to construct a minimum-weight -connected spanning subgraph in a
weighted complete graph, a NP-hard problem even if the weights satisfy the triangle inequal-
ity. We show that our algorithm gives an approximation ratio of for a metric graph,
for a random graph with nodes uniformly randomly distributed in and
for a complete graph with random edge weights . We show that our scheme is optimal
with respect to the amount of “local information” needed to compute any connected spanning
subgraph. We then show that our scheme can be applied to design an efficient distributed algo-
rithm for constructing such an approximate -connected spanning subgraph (for any ) in
a point-to-point distributed model, where the processors form a complete network. Our algo-
rithm takes time and expected messages. Our result in conjunction with
a result of Korach et al. ([21]) implies that the expected message complexity of our algorithm
is significantly better than the best distributed algorithm that finds an optimal -connected
subgraph. We also show that for the geometric instances, our randomized scheme constructs
low-degree -connected spanning subgraphs which have maximum degree, with
您可能关注的文档
- 1. jj travail présenté au congrès mondial de stronglstrong'aquaculture, à.pdf
- 11 introduction emotion special issue.pdf
- 101 101e strongmanagementstrong and organizational behavior.pdf
- 110 greville stronggstrong. corbet - uts linux transition.pdf
- 11-level cascaded stronghstrong-bridge grid-tied inverter interface with.pdf
- 140-2012 building an optimal execution plan for liquidity.pdf
- 1339 integrating the healthcare enterprise a primer.pdf
- 18f-fdopa kinetics in brain tumors.pdf
- 1984 is still fiction electronic monitoring in the workplace.pdf
- 2. capital strongaccountstrong liberalization, growth and the labor share.pdf
文档评论(0)