Fabian Kuhn
ABSTRACT
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP relaxation techniques. For an arbitrary parameter k and maximum degree Δ, our algorithm computes a dominating set of expected size O(kΔ2/k log Δ|DSOPT|) in O(k2) rounds where each node has to send O(k2Δ) messages of size O(logΔ). This is the first algorithm which achieves a non-trivial approximation ratio in a constant number of rounds.
- K. Alzoubi, P.-J. Wan, and O. Frieder. Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In Proc. of the 3rd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), pages 157--164, EPFL Lausanne, Switzerland, 2002. Google Scholar
Digital Library
- Y. Bartal, J. W. Byers, and D. Raz. Global Optimization Using Local Information with Applications to Flow Control. In Proc. of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 303--312, 1997. Google ScholarDigital Library
- B. Berger, J. Rompel, and P. Shor. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. Journal of Computer and System Sciences, 49:454--477, 1994. Google ScholarDigital Library
- V. Chvátal. Linear Programming. W. H. Freeman and Company, 1983.Google Scholar
- D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan. Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 717--724, 2003. Google ScholarDigital Library
- U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998. Google ScholarDigital Library
- J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete Mobile Centers. In Proc. of the 17th annual symposium on Computational geometry (SCG), pages 188--196. ACM Press, 2001. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979. Google ScholarDigital Library
- S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In Proc. of the 4th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 179--193, 1996. Google ScholarDigital Library
- L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 33--42, 2001.Google Scholar
- D. S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9:256--278, 1974.Google ScholarDigital Library
- R. M. Karp. Reducibility Among Combinatorial Problems. In Proc. of a Symposium on the Complexity of Computer Computations, pages 85--103, 1972.Google ScholarCross Ref
- S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms, 28:40--66, 1998. Google ScholarDigital Library
- L. Lovasz. On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics, 13:383--390, 1975.Google ScholarDigital Library
- M. Luby and N. Nisan. A Parallel Approximation Algorithm for Positive Linear Programming. In Proc. of the 25th ACM Symposium on Theory of Computing (STOC), pages 448--457, 1993. Google ScholarDigital Library
- S. Rajagopalan and V. Vazirani. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM Journal on Computing, 28:525--540, 1998. Google ScholarDigital Library
- R. Rajaraman. Topology Control and Routing in Ad hoc Networks: A Survey. SIGACT News, 33:60--73, June 2002. Google ScholarDigital Library
- P. Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover. In Proc. of the 28th ACM Symposium on Theory of Computing (STOC), pages 435--441, 1996. Google ScholarDigital Library
- J. Wu and H. Li. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In Proc. of the 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), pages 7--14, 1999. Google ScholarDigital Library
Index Terms
- Constant-time distributed dominating set approximation
Recommendations
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe describe a simple deterministic O(ε-1 log Δ) round distributed algorithm for (2α+ 1) (1 + ε) approximation of minimum weighted dominating set on graphs with arboricity at most α. Here Δ denotes the maximum degree. We also show a lower bound proving ...
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed ComputingWe develop deterministic approximation algorithms for the minimum dominating set problem in the CONGEST model with an almost optimal approximation guarantee. For ε 1/ poly log Δ we obtain two algorithms with approximation factor (1 + ε)(1 + ł n (Δ + 1)) ...
A sublinear-time randomized approximation algorithm for matrix games
This paper presents a parallel randomized algorithm which computes a pair of @e-optimal strategies for a given (m,n)-matrix game A = [a"i"j] @e [-1, 1] in O(@e^-^2log^2(n+m)) expected time on an (n+m)/log(n+m)-processor EREW PRAM. For any fixed accuracy ...
Comments