Affiliation:
1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China
2. School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Nanjing 210023, China
Abstract
In this paper, we consider a variant of dominating set problem, i.e., the total dominating set problem. Given an undirected graph G=(V,E), a subset of vertices T⊆V is called a total dominating set if every vertex in V is adjacent to at least one vertex in T. Based on LP relaxation techniques, this paper gives a distributed approximation algorithm for the total dominating set problem in general graphs. The presented algorithm obtains a fractional total dominating set that is, at most, k(1+Δ1k)Δ1k times the size of the optimal solution to this problem, where k is a positive integer and Δ is the maximum degree of G. The running time of this algorithm is constant communication rounds under the assumption of a synchronous communication model.
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference40 articles.
1. Jiang, P., Liu, J., Wu, F., Wang, J., and Xue, A. (2016). Node deployment algorithm for underwater sensor networks based on connected dominating set. Sensors, 16.
2. Dominating set and network coding-based routing in wireless mesh networks;Chen;IEEE Trans. Parallel Distrib. Syst.,2013
3. Combinatorially based cryptography for children (and adults);Fellows;Congr. Numer.,1994
4. Kwon, S., Kang, J.S., and Yeom, Y. (2021, January 23–25). Analysis of public-key cryptography using a 3-regular graph with a perfect dominating set. Proceedings of the IEEE Region 10 Symposium (TENSYMP), Grand Hyatt Jeju, Republic of Korea.
5. Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions;Allesina;J. Theor. Biol.,2004
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献