摘要:分布式算法求解最小支配集问题及其他问题，一种新方法

Proceedings of the ... International Symposium on High Performance Distributed Computing Pub Date : 2022-01-01 DOI:10.4230/LIPIcs.DISC.2022.40

Sharareh Alipour, Mohammadhadi Salari

{"title":"摘要:分布式算法求解最小支配集问题及其他问题，一种新方法","authors":"Sharareh Alipour, Mohammadhadi Salari","doi":"10.4230/LIPIcs.DISC.2022.40","DOIUrl":null,"url":null,"abstract":"In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set (MTDS) problem. We propose a new idea to compute approximate MDS and MTDS. This new approach can be implemented in a distributed model or parallel model. We also show how to use this new approach in other related problems such as set cover problem and k -distance dominating set problem.","PeriodicalId":89463,"journal":{"name":"Proceedings of the ... International Symposium on High Performance Distributed Computing","volume":"1 1","pages":"40:1-40:3"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach\",\"authors\":\"Sharareh Alipour, Mohammadhadi Salari\",\"doi\":\"10.4230/LIPIcs.DISC.2022.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set (MTDS) problem. We propose a new idea to compute approximate MDS and MTDS. This new approach can be implemented in a distributed model or parallel model. We also show how to use this new approach in other related problems such as set cover problem and k -distance dominating set problem.\",\"PeriodicalId\":89463,\"journal\":{\"name\":\"Proceedings of the ... International Symposium on High Performance Distributed Computing\",\"volume\":\"1 1\",\"pages\":\"40:1-40:3\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... International Symposium on High Performance Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.DISC.2022.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.DISC.2022.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了最小控制集问题和最小总控制集问题。我们提出了一种计算近似MDS和MTDS的新思路。这种新方法可以在分布式模型或并行模型中实现。我们还展示了如何将这种新方法应用于其他相关问题，如集覆盖问题和k距离支配集问题。

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

查看原文本刊更多论文

Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach

In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set (MTDS) problem. We propose a new idea to compute approximate MDS and MTDS. This new approach can be implemented in a distributed model or parallel model. We also show how to use this new approach in other related problems such as set cover problem and k -distance dominating set problem.

求助全文

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

来源期刊

Proceedings of the ... International Symposium on High Performance Distributed Computing

自引率

0.00%

发文量