求给定直径边不相交生成树最小总重的渐近最优方法

IF 0.6 4区计算机科学 Q4 AUTOMATION & CONTROL SYSTEMS

Automation and Remote Control Pub Date : 2023-10-01 DOI:10.1134/S0005117923070068

E. Kh. Gimadi, A. A. Shtepa

{"title":"求给定直径边不相交生成树最小总重的渐近最优方法","authors":"E. Kh. Gimadi, A. A. Shtepa","doi":"10.1134/S0005117923070068","DOIUrl":null,"url":null,"abstract":"We consider the intractable problem of finding several edge-disjoint spanning trees of the minimum total weight with a given diameter in complete undirected graph in current paper. The weights of edges of a graph are random variables from several continuous distributions: uniform, biased truncated exponential, biased truncated normal. The approximation algorithm with time complexity \\(\\mathcal{O}\\)(n2), where n is number of vertices in graph, is proposed for solving this problem. The asymptotic optimality conditions for constructed algorithm is presented for each considered probabilistic distribution.","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter\",\"authors\":\"E. Kh. Gimadi, A. A. Shtepa\",\"doi\":\"10.1134/S0005117923070068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the intractable problem of finding several edge-disjoint spanning trees of the minimum total weight with a given diameter in complete undirected graph in current paper. The weights of edges of a graph are random variables from several continuous distributions: uniform, biased truncated exponential, biased truncated normal. The approximation algorithm with time complexity \\\\(\\\\mathcal{O}\\\\)(n2), where n is number of vertices in graph, is proposed for solving this problem. The asymptotic optimality conditions for constructed algorithm is presented for each considered probabilistic distribution.\",\"PeriodicalId\":55411,\"journal\":{\"name\":\"Automation and Remote Control\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automation and Remote Control\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S0005117923070068\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation and Remote Control","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1134/S0005117923070068","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文讨论了在完全无向图中求几个给定直径的最小总权边不相交生成树的棘手问题。图的边的权重是来自几个连续分布的随机变量：均匀、有偏截尾指数、有偏截断正态。针对这一问题，提出了具有时间复杂性的近似算法\（\mathcal｛O｝\）（n2），其中n是图中的顶点数。对于每个考虑的概率分布，给出了构造算法的渐近最优性条件。

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

On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter

查看原文本刊更多论文

On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter

We consider the intractable problem of finding several edge-disjoint spanning trees of the minimum total weight with a given diameter in complete undirected graph in current paper. The weights of edges of a graph are random variables from several continuous distributions: uniform, biased truncated exponential, biased truncated normal. The approximation algorithm with time complexity \(\mathcal{O}\)(n²), where n is number of vertices in graph, is proposed for solving this problem. The asymptotic optimality conditions for constructed algorithm is presented for each considered probabilistic distribution.

求助全文

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

来源期刊

Automation and Remote Control 工程技术-仪器仪表

CiteScore

1.70

自引率

28.60%

发文量

审稿时长

3-8 weeks

期刊介绍： Automation and Remote Control is one of the first journals on control theory. The scope of the journal is control theory problems and applications. The journal publishes reviews, original articles, and short communications (deterministic, stochastic, adaptive, and robust formulations) and its applications (computer control, components and instruments, process control, social and economy control, etc.).