A strengthened analysis of an algorithm for DOMINATING SET in planar graphs

被引：0
|
作者：
Hagerup, Torben [1 ]
机构：
[1] Univ Augsburg, Inst Informat, D-86135 Augsburg, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 06期
关键词：
Dominating set; Planar graph; Parameterized complexity; PARAMETERIZED ALGORITHMS;
D O I：
10.1016/j.dam.2010.10.004
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Alber et al. presented an algorithm for computing a dominating set of size at most k, if one exists, in an undirected planar n-vertex graph and bounded its execution time by O(8(k)0). Here it is shown that the algorithm performs better than claimed by its authors. More significantly, if k <= n/19, even a much simplified version of the algorithm runs in O(7(k)n) time. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：793 / 798
页数：6
相关论文
共 50 条
  • [1] A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
    Wawrzyniak, Wojciech
    INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 94 - 98
  • [2] Computational study on dominating set problem of planar graphs
    Marzban, Marjan
    Gu, Qian-Ping
    Jia, Xiaohua
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 89 - 102
  • [3] Distributed Dominating Set Approximations beyond Planar Graphs
    Amiri, Saeed Akhoondian
    Schmid, Stefan
    Siebertz, Sebastian
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (03)
  • [4] Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
    Czygrinow, A.
    Hanckowiak, M.
    Szymanska, E.
    Wawrzyniak, W.
    Witkowski, M.
    THEORETICAL COMPUTER SCIENCE, 2017, 662 : 1 - 8
  • [5] Refined search tree technique for DOMINATING SET on planar graphs
    Alber, J
    Fan, HB
    Fellows, MR
    Fernau, H
    Niedermeier, R
    Rosamond, F
    Stege, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 111 - 122
  • [6] A refined search tree technique for Dominating Set on planar graphs
    Alber, J
    Fan, HB
    Fellows, MR
    Fernau, H
    Niedermeier, R
    Rosamond, F
    Stege, U
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 71 (04) : 385 - 405
  • [7] PTASs for secure dominating set in planar graphs and growth-bounded graphs
    Li, Ke
    Zhang, Zhao
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 343 - 351
  • [8] Brief Announcement: A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs
    Alipour, Sharareh
    Jafari, Amir
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 501 - 502
  • [9] Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
    Alber, J
    Bodlaender, HL
    Fernau, H
    Kloks, T
    Niedermeier, R
    ALGORITHMICA, 2002, 33 (04) : 461 - 493
  • [10] Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
    Algorithmica, 2002, 33 : 461 - 493
12345