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 条
  • [41] Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory
    Torkestani, Javad Akbari
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 769 - 801
  • [42] Approximation Algorithms for Steiner Connected Dominating Set
    Ya-Feng Wu
    Yin-Long Xu
    Guo-Liang Chen
    Journal of Computer Science and Technology, 2005, 20 : 713 - 716
  • [43] Exponential time algorithms for the minimum dominating set problem on some graph classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 148 - 159
  • [44] Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
    Ghaffari, Mohsen
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II, 2014, 8573 : 483 - 494
  • [45] Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    Todinca, Ioan
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [46] Finding minimum weight connected dominating set in stochastic graph based on learning automata
    Torkestani, Javad Akbari
    Meybodi, Mohammad Reza
    INFORMATION SCIENCES, 2012, 200 : 57 - 77
  • [47] A New Approximation Algorithm for Minimum-Weight ( 1, m ) -Connected Dominating Set
    Zhou, Jiao
    Ran, Yingli
    Pardalos, Panos M.
    Zhang, Zhao
    Tang, Shaojie
    Du, Ding-Zhu
    INFORMS JOURNAL ON COMPUTING, 2024,
  • [48] A heuristic algorithm for minimum connected dominating set with maximal weight in ad hoc networks
    Yan, XF
    Sun, YG
    Wang, YL
    GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 719 - 722
  • [49] TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
    Zhang, Zhao
    Liu, Qinghai
    Li, Deying
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (04) : 485 - 498
  • [50] A 2-approximation algorithm for the minimum weight edge dominating set problem
    Fujito, T
    Nagamochi, H
    DISCRETE APPLIED MATHEMATICS, 2002, 118 (03) : 199 - 207
12345