随机输入数据上给定直径无向MST问题的渐近最优方法

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) Pub Date : 2019-08-01 DOI:10.1109/OPCS.2019.8880223

E. Gimadi, A. Shevyakov, E. Shin

{"title":"随机输入数据上给定直径无向MST问题的渐近最优方法","authors":"E. Gimadi, A. Shevyakov, E. Shin","doi":"10.1109/OPCS.2019.8880223","DOIUrl":null,"url":null,"abstract":"We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data\",\"authors\":\"E. Gimadi, A. Shevyakov, E. Shin\",\"doi\":\"10.1109/OPCS.2019.8880223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880223\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

给出了求解n顶点完全无向图上具有给定直径的随机无向MST的近似确定性算法。问题是NP-hard。算法的时间复杂度为二次。在给定图的边权为同独立的均匀分布随机变量，且其端为正区间的条件下，进行了概率分析。给出了渐近最优性的充分条件。

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

查看原文本刊更多论文

Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data

We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.

求助全文

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

来源期刊

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

自引率

0.00%

发文量