A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

被引：12
|
作者：
Gao, Xiaofeng [1 ]
Wang, Wei [2 ]
Zhang, Zhao [3 ]
Zhu, Shiwei [4 ]
Wu, Weili [1 ]
机构：
[1] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75083 USA
[2] Xi An Jiao Tong Univ, Sch Sci, Xian 710049, Peoples R China
[3] Xinjiang Univ, Coll Math & Syst Sci, Xinjiang, Peoples R China
[4] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN USA
来源：
OPTIMIZATION LETTERS | 2010年 / 4卷 / 03期
关键词：
PTAS; Connected dominating set; Growth-bounded graph; WIRELESS NETWORKS; APPROXIMATION SCHEME;
D O I：
10.1007/s11590-009-0148-3
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we design the first polynomial time approximation scheme for d-hop connected dominating set (d-CDS) problem in growth-bounded graphs, which is a general type of graphs including unit disk graph, unit ball graph, etc. Such graphs can represent majority types of existing wireless networks. Our algorithm does not need geometric representation (e. g., specifying the positions of each node in the plane) beforehand. The main strategy is clustering partition. We select the d-CDS for each subset separately, union them together, and then connect the induced graph of this set. We also provide detailed performance and complexity analysis.
引用
收藏
页码：321 / 333
页数：13
相关论文
共 50 条
  • [1] A PTAS for minimum d-hop connected dominating set in growth-bounded graphs
    Xiaofeng Gao
    Wei Wang
    Zhao Zhang
    Shiwei Zhu
    Weili Wu
    Optimization Letters, 2010, 4 : 321 - 333
  • [2] PTAS for the minimum weighted dominating set in growth bounded graphs
    Wang, Zhong
    Wang, Wei
    Kim, Joon-Mo
    Thuraisingham, Bhavani
    Wu, Weili
    JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (03) : 641 - 648
  • [3] PTAS for the minimum weighted dominating set in growth bounded graphs
    Zhong Wang
    Wei Wang
    Joon-Mo Kim
    Bhavani Thuraisingham
    Weili Wu
    Journal of Global Optimization, 2012, 54 : 641 - 648
  • [4] PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
    Lidong Wu
    Hongwei Du
    Weili Wu
    Yuqing Zhu
    Ailan Wang
    Wonjun Lee
    Journal of Combinatorial Optimization, 2015, 30 : 18 - 26
  • [5] PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
    Wu, Lidong
    Du, Hongwei
    Wu, Weili
    Zhu, Yuqing
    Wang, Ailan
    Lee, Wonjun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (01) : 18 - 26
  • [6] PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs
    Chu, Yan
    Fan, Jianxi
    Liu, Wenjun
    Lin, Cheng-Kuan
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2014, PT I, 2014, 8630 : 114 - 126
  • [7] The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
    Xianliang Liu
    Wei Wang
    Donghyun Kim
    Zishen Yang
    Alade O. Tokuta
    Yaolin Jiang
    Wireless Networks, 2016, 22 : 553 - 562
  • [8] The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
    Liu, Xianliang
    Wang, Wei
    Kim, Donghyun
    Yang, Zishen
    Tokuta, Alade O.
    Jiang, Yaolin
    WIRELESS NETWORKS, 2016, 22 (02) : 553 - 562
  • [9] PTASs for secure dominating set in planar graphs and growth-bounded graphs
    Li, Ke
    Zhang, Zhao
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 343 - 351
  • [10] A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs
    Gfeller, Beat
    Vicari, Elias
    AD HOC & SENSOR WIRELESS NETWORKS, 2008, 6 (3-4) : 197 - 213
12345