Algorithms for the minimum weight k-fold (connected) dominating set problem

Authors:
Wenkai Ma;Deying Li;Zhao Zhang
Affiliations:
Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing, China 100872;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing, China 100872;College of Mathematics and System Sciences, Xinjiang University, Urumqi, China
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 16
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Journal of Global Optimization
Constant-time distributed dominating set approximation

Distributed Computing
A simple improved distributed algorithm for minimum CDS in unit disk graphs

ACM Transactions on Sensor Networks (TOSN)
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks

Journal of Global Optimization
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs

IEEE Transactions on Mobile Computing
Approximation algorithms for unit disk graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of computing a minimum weight k-fold dominating set (MWkDS) or a minimum weight k-fold connected dominating set (MWkCDS) in a unit ball graph (UBG). Using slab decomposition and dynamic programming, we give two exact algorithms for the computation of MWkDS and MWkCDS which can be executed in polynomial time if the thickness of the graph is bounded above.