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 条
  • [11] Approximation algorithms for minimum weight partial connected set cover problem
    Dongyue Liang
    Zhao Zhang
    Xianliang Liu
    Wei Wang
    Yaolin Jiang
    Journal of Combinatorial Optimization, 2016, 31 : 696 - 712
  • [12] Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
    Gendron, Bernard
    Lucena, Abilio
    da Cunha, Alexandre Salles
    Simonetti, Luidi
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (04) : 645 - 657
  • [13] Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
    Sun, Xuemei
    Yang, Yongxin
    Ma, Maode
    SENSORS, 2019, 19 (08)
  • [14] On minimum m-connected k-dominating set problem in unit disc graphs
    Weiping Shang
    Frances Yao
    Pengjun Wan
    Xiaodong Hu
    Journal of Combinatorial Optimization, 2008, 16 : 99 - 106
  • [15] On minimum m-connected k-dominating set problem in unit disc graphs
    Shang, Weiping
    Yao, Frances
    Wan, Pengjun
    Hu, Xiaodong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (02) : 99 - 106
  • [16] A greedy randomized adaptive search procedure (GRASP) for minimum 2-fold connected dominating set problem
    Nie, Xiaolin
    Zhang, Quanli
    Qiao, Yixin
    Qi, Zijun
    Zhang, Lilin
    Niu, Dangdang
    Zhang, Hongming
    APPLIED SOFT COMPUTING, 2024, 165
  • [17] Minimum Connected Dominating Set Algorithm with Weight in Wireless Sensor Networks
    Zhang Jing
    Jia Chun-fu
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 3973 - 3976
  • [18] A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem
    Ugurlu, O.
    Tanir, D.
    RECENT DEVELOPMENTS AND THE NEW DIRECTION IN SOFT-COMPUTING FOUNDATIONS AND APPLICATIONS, 2018, 361 : 137 - 148
  • [19] An efficient matheuristic for the minimum-weight dominating set problem
    Albuquerque, Mayra
    Vidal, Thibaut
    APPLIED SOFT COMPUTING, 2018, 72 : 527 - 538
  • [20] A hybrid algorithmic model for the minimum weight dominating set problem
    Bouamama, Salim
    Blum, Christian
    SIMULATION MODELLING PRACTICE AND THEORY, 2016, 64 : 57 - 68
12345