Minimum connected dominating sets and maximal independent sets in unit disk graphs

被引：137
|
作者：
Wu, WL [1 ]
Du, HW
Jia, XH
Li, YS
Huang, SCH
机构：
[1] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA
[2] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[3] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30302 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2006年 / 352卷 / 1-3期
基金：
美国国家科学基金会;
关键词：
connected dominating set; independent set; unit disk graphs;
D O I：
10.1016/j.tcs.2005.08.037
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the size mis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G) <= 4 (.) cds(G) + 1 for all unit disk graphs G. In this paper, we improve it by showing mis(G) <= 3.8 (.) cds(G) + 1.2. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 7
页数：7
相关论文
共 50 条
  • [1] New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
    Zou, Feng
    Wang, Yuexuan
    Xu, Xiao-Hua
    Li, Xianyue
    Du, Hongwei
    Wan, Pengjun
    Wu, Weili
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (03) : 198 - 208
  • [2] Distributed Connected Dominating Sets in Unit Square and Disk Graphs
    Gorain, Barun
    Mondal, Kaushik
    Pandit, Supantha
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 346 - 358
  • [3] Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
    Ambuhl, Christoph
    Erlebach, Thomas
    Mihal'ak, Matus
    Nunkesser, Marc
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 3 - 14
  • [4] Reconfiguring Minimum Independent Dominating Sets in Graphs
    Brewster, R. C.
    Mynhardt, C. M.
    Teshima, L. E.
    [J]. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (03) : 389 - 411
  • [5] Reconfiguration of Minimum Independent Dominating Sets in Graphs
    Brewster, R.C.
    Mynhardt, C.M.
    Teshima, L.E.
    [J]. arXiv, 2023,
  • [6] Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes
    Czyzowicz, J.
    Dobrev, S.
    Fevens, T.
    Gonzalez-Aguilar, H.
    Kranakis, E.
    Opatrny, J.
    Urrutia, J.
    [J]. LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 158 - +
  • [7] Connected dominating sets in disk graphs with bidirectional links
    Thai, MT
    Du, DZ
    [J]. IEEE COMMUNICATIONS LETTERS, 2006, 10 (03) : 138 - 140
  • [8] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
    Hjuler, Niklas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    Saulpic, David
    [J]. 36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [9] Minimum connected dominating sets of random cubic graphs
    Duckworth, W.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2002, 9
  • [10] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
12345