最小支配集问题的分布式算法：从理论到应用
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
摘要：
本文提出了一种求解最小支配集问题的分布式算法。对于某些特殊的网络，我们从理论上证明了所提出的算法得到的解是精确解的一个常数逼近因子。这个问题在社交网络中自然出现，例如在新闻传播中，避免谣言传播和推荐传播。因此，我们实现了我们的算法在大规模的社交网络和比较我们的结果与最先进的算法。此外，我们将我们的算法扩展到解决$k$ -距离支配集问题，并实验研究所提出的算法的效率。我们提出的算法是快速和易于实现，并可用于动态网络中的边和顶点不断增加或删除。更重要的是，基于实验结果，该算法具有合理的解决方案和运行时间，使我们能够实际使用在分布式模型。
英文摘要：
In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact answer. This problem arises naturally in social networks, for example in news spreading, avoiding rumor spreading and recommendation spreading. So we implement our algorithm on massive social networks and compare our results with the state of the art algorithms. Also, we extend our algorithm to solve the $k$-distance dominating set problem and experimentally study the efficiency of the proposed algorithm. Our proposed algorithm is fast and easy to implement and can be used in dynamic networks where the edges and vertices are added or deleted constantly. More importantly, based on the experimental results the proposed algorithm has reasonable solutions and running time which enables us to use it in distributed model practically.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
