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 条
  • [1] Algorithms for the minimum weight k-fold (connected) dominating set problem
    Ma, Wenkai
    Li, Deying
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (04) : 528 - 540
  • [2] ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
    Shang, Weiping
    Wang, Xiumei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (01) : 9 - 15
  • [3] A greedy algorithm for the minimum -connected -fold dominating set problem
    Shi, Yishuo
    Zhang, Yaping
    Zhang, Zhao
    Wu, Weili
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 136 - 151
  • [4] Algorithms for minimum m-connected k-dominating set problem
    Shang, Weiping
    Yao, Frances
    Wan, Pengjun
    Hu, Xiaodong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 182 - +
  • [5] Algorithms for minimum m-connected k-tuple dominating set problem
    Shang, Weiping
    Wan, Pengjun
    Yao, Frances
    Hu, Xiaodong
    THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 241 - 247
  • [6] Two population-based optimization algorithms for minimum weight connected dominating set problem
    Dagdeviren, Zuleyha Akusta
    Aydin, Dogan
    Cinsdikici, Muhammed
    APPLIED SOFT COMPUTING, 2017, 59 : 644 - 658
  • [7] Greedy Algorithms for Minimum Connected Dominating Set Problems
    Yang, Deren
    Wang, Xiaofeng
    PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES, 2009, : 643 - 646
  • [8] Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
    Zhang, Zhao
    Zhou, Jiao
    Tang, Shaojie
    Huang, Xiaohui
    Du, Ding-Zhu
    INFORMS JOURNAL ON COMPUTING, 2018, 30 (02) : 217 - 224
  • [9] Hybrid metaheuristic algorithms for minimum weight dominating set
    Potluri, Anupama
    Singh, Alok
    APPLIED SOFT COMPUTING, 2013, 13 (01) : 76 - 88
  • [10] Approximation algorithms for minimum weight partial connected set cover problem
    Liang, Dongyue
    Zhang, Zhao
    Liu, Xianliang
    Wang, Wei
    Jiang, Yaolin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 696 - 712
12345