Greedy Algorithms for Minimum Connected Dominating Set Problems

被引：0
|
作者：
Yang, Deren [1 ]
Wang, Xiaofeng [1 ]
机构：
[1] Ningxia Med Univ, Coll Sci, Yinchuan, Peoples R China
来源：
PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES | 2009年
关键词：
CDS; MCDS; interval graphs; greedy algorithm; spanning tree; TRACKING MOBILE USERS; APPROXIMATION;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
To solve connected dominating problem, it is necessary to find minimum connected dominating set (MCDS for short). However, to find MCDS is NP-hardness. So, a graph model called interval graph is constructed from nodes of related network. Two greedy algorithms with linear (or polynomial time) are used to find MCDS on proper interval graph (or interval graph), and have 1 approximation ratio on the graphs. And spanning trees are constructed and used to validate the correctness and effectiveness of corresponding algorithms.
引用
收藏
页码：643 / 646
页数：4
相关论文
共 50 条
  • [1] Greedy approximation for the minimum connected dominating set with labeling
    Zishen Yang
    Majun Shi
    Wei Wang
    Optimization Letters, 2021, 15 : 685 - 700
  • [2] Greedy approximation for the minimum connected dominating set with labeling
    Yang, Zishen
    Shi, Majun
    Wang, Wei
    OPTIMIZATION LETTERS, 2021, 15 (02) : 685 - 700
  • [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 CONNECTED CAPACITATED DOMINATING SET PROBLEM
    Shang, Weiping
    Wang, Xiumei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (01) : 9 - 15
  • [5] A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network
    Fu, Deqian
    Han, Lihua
    Yang, Zifen
    Jhang, Seong Tae
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (07):
  • [6] A greedy approximation for minimum connected dominating sets
    Ruan, L
    Du, HW
    Jia, XH
    Wu, WL
    Li, YS
    Ko, K
    THEORETICAL COMPUTER SCIENCE, 2004, 329 (1-3) : 325 - 330
  • [7] Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
    Sun, Xuemei
    Yang, Yongxin
    Ma, Maode
    SENSORS, 2019, 19 (08)
  • [8] A Distributed Greedy Algorithm for Construction of Minimum Connected Dominating Set in Wireless Sensor Network
    Mohanty, Jasaswi Prasad
    Mandal, Chittaranjan
    2014 APPLICATIONS AND INNOVATIONS IN MOBILE COMPUTING (AIMOC), 2014, : 104 - 110
  • [9] Online Deterministic Algorithms for Connected Dominating Set & Set Cover Leasing Problems
    Markarian, Christine
    Kassar, Abdul-Nasser
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 121 - 128
  • [10] A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem
    Niu, Dangdang
    Nie, Xiaolin
    Zhang, Lilin
    Zhang, Hongming
    Yin, Minghao
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 215
12345