On distance r-dominating and 2r-independent sets in sparse graphs

被引：8
|
作者：
Dvorak, Zdenek [1 ]
机构：
[1] Charles Univ Prague, Comp Sci Inst, Malostranske Namesti 25, CR-11800 Prague, Czech Republic
来源：
JOURNAL OF GRAPH THEORY | 2019年 / 91卷 / 02期
关键词：
approximation; dominating set; independent set; weak coloring number; APPROXIMATION ALGORITHMS; EXPANSION;
D O I：
10.1002/jgt.22426
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Dvorak [European J. Combin. 34 (2013), pp. 833-840] gave a bound on the minimum size of a distance r-dominating set in terms of the maximum size of a distance 2r-independent set and generalized coloring numbers, thus obtaining a constant-factor approximation algorithm for the parameters in any class of graphs with bounded expansion. We improve and clarify this dependence using a linear programming (LP)-based argument inspired by the work of Bansal and Umboh [Inform. Process. Lett. 122 (2017), pp. 21-24].
引用
收藏
页码：162 / 173
页数：12
相关论文
共 50 条
  • [31] 1-MOVABLE 2-OUTER-INDEPENDENT DOMINATING SETS IN GRAPHS
    Miculob, Vanesa S.
    Hinampas Jr, Renario G.
    Hinampas, Jocecar L.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2024, 41 (07): : 589 - 602
  • [32] EFFICIENT PARALLEL ALGORITHMS FOR R-DOMINATING SET AND PARA-CENTER PROBLEMS ON TREES
    XIN, H
    YESHA, Y
    ALGORITHMICA, 1990, 5 (01) : 129 - 145
  • [33] GRAPHS WITH UNIQUE MINIMUM EDGE DOMINATING SETS AND GRAPHS WITH UNIQUE MAXIMUM INDEPENDENT SETS OF VERTICES
    TOPP, J
    DISCRETE MATHEMATICS, 1993, 121 (1-3) : 199 - 210
  • [34] A note on connected dominating sets of distance-hereditary graphs
    Schaudt, Oliver
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (09) : 1394 - 1398
  • [35] Efficient parallel algorithms for the r-dominating set and p-center problems on trees
    Lin, TC
    Wang, BF
    NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 117 - 122
  • [36] On distance-s locating and distance-t dominating sets in graphs
    Yi, Eunjeong
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (04)
  • [37] Fair splittings by independent sets in sparse graphs
    Alexander Black
    Umur Cetin
    Florian Frick
    Alexander Pacun
    Linus Setiabrata
    Israel Journal of Mathematics, 2020, 236 : 603 - 627
  • [38] Independent perfect dominating sets in semi-Cayley graphs
    Wang, Xiaomeng
    Xu, Shou-Jun
    Li, Xianyue
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 50 - 57
  • [39] On r-locating-dominating sets in paths
    Honkala, Iiro
    EUROPEAN JOURNAL OF COMBINATORICS, 2009, 30 (04) : 1022 - 1025
  • [40] Fair splittings by independent sets in sparse graphs
    Black, Alexander
    Cetin, Umur
    Frick, Florian
    Pacun, Alexander
    Setiabrata, Linus
    ISRAEL JOURNAL OF MATHEMATICS, 2020, 236 (02) : 603 - 627
12345