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

被引：0
|
作者：
Wenkai Ma
Deying Li
Zhao Zhang
机构：
[1] Renmin University of China,Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information
[2] Xinjiang University,College of Mathematics and System Sciences
来源：
Journal of Combinatorial Optimization | 2012年 / 23卷
关键词：
-fold dominating set; Slab decomposition; Algorithm; Unit ball graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：528 / 540
页数：12
相关论文
共 50 条
  • [31] An algorithm based on ant colony optimization for the minimum connected dominating set problem
    Bouamama, Salim
    Blum, Christian
    Fages, Jean-Guillaume
    APPLIED SOFT COMPUTING, 2019, 80 : 672 - 686
  • [32] Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem
    Liu, Ziwen
    Wu, Xinyun
    PROCEEDINGS OF 2020 IEEE 10TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION (ICEIEC 2020), 2020, : 146 - 149
  • [33] An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
    Ahn, Namsu
    Park, Sungsoo
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2011, 10 (03): : 221 - 231
  • [34] The probabilistic minimum dominating set problem
    Boria, Nicolas
    Murat, Cecile
    Paschos, Vangelis Th.
    DISCRETE APPLIED MATHEMATICS, 2018, 234 : 93 - 113
  • [35] An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
    Ahn, Namsu
    Park, Sungsoo
    WIRELESS NETWORKS, 2015, 21 (03) : 783 - 792
  • [36] An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
    Namsu Ahn
    Sungsoo Park
    Wireless Networks, 2015, 21 : 783 - 792
  • [37] The k-hop connected dominating set problem: approximation and hardness
    Coelho, Rafael S.
    Moura, Phablo F. S.
    Wakabayashi, Yoshiko
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1060 - 1083
  • [38] The k-hop connected dominating set problem: approximation and hardness
    Rafael S. Coelho
    Phablo F. S. Moura
    Yoshiko Wakabayashi
    Journal of Combinatorial Optimization, 2017, 34 : 1060 - 1083
  • [39] Two algorithms for minimum 2-connected r-hop dominating set
    Li, Xiuying
    Zhang, Zhao
    INFORMATION PROCESSING LETTERS, 2010, 110 (22) : 986 - 991
  • [40] Approximation algorithms for Steiner connected dominating set
    Wu, YF
    Xu, YL
    Chen, GL
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (05) : 713 - 716
12345