Profit Parameterizations of DOMINATING SET

被引：0
|
作者：
Fernau, Henning [1 ]
Stege, Ulrike [2 ]
机构：
[1] Univ Trier, Fachbereich 4, Abt Informat Wissensch, CIRT, D-54286 Trier, Germany
[2] Univ Victoria, Dept Comp Sci, Victoria, BC, Canada
来源：
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019 | 2019年 / 11640卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Profit problems; Parameterized Complexity; Domination; SPANNING STAR FOREST; ALGORITHMS;
D O I：
10.1007/978-3-030-27195-4_10
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
DOMINATING SET is one of the most classical NP-complete combinatorial graph problems. Unfortunately, the natural parameterization (by solution size) does not make this problem feasible in the sense of Parameterized Complexity. We propose two new views to consider Dominating Set, and a new parameterization of this problem (by the profit parameter) and give algorithms for these parameterizations that show the problems to be in FPT. More precisely, we give a linear-size kernel and a search-tree procedure.
引用
收藏
页码：108 / 120
页数：13
相关论文
共 50 条
  • [1] Structural Parameterizations of Dominating Set Variants
    Goyal, Dishant
    Jacob, Ashwin
    Kumar, Kaushtubh
    Majumdar, Diptapriyo
    Raman, Venkatesh
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 157 - 168
  • [2] Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
    Gutin, G.
    Jones, M.
    Yeo, A.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5744 - 5751
  • [3] DOMINATING SET AND CONVERSE DOMINATING SET OF A DIRECTED GRAPH
    FU, Y
    AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (08): : 861 - +
  • [4] An independent dominating set in the complement of a minimum dominating set of a tree
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    APPLIED MATHEMATICS LETTERS, 2010, 23 (01) : 79 - 81
  • [5] Partitioning the Vertices of a Graph into a Total Dominating Set and an Independent Dominating Set
    Delgado, Pamela
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    ARS COMBINATORIA, 2019, 144 : 367 - 379
  • [6] Online Dominating Set
    Joan Boyar
    Stephan J. Eidenbenz
    Lene M. Favrholdt
    Michal Kotrbčík
    Kim S. Larsen
    Algorithmica, 2019, 81 : 1938 - 1964
  • [7] Online Dominating Set
    Boyar, Joan
    Eidenbenz, Stephan J.
    Favrholdt, Lene M.
    Kotrbcik, Michal
    Larsen, Kim S.
    ALGORITHMICA, 2019, 81 (05) : 1938 - 1964
  • [8] On the dominating set polytope
    Bouchakour, M.
    Contenza, T. M.
    Lee, C. W.
    Mahjoub, A. R.
    EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (03) : 652 - 661
  • [9] Dominating set games
    van Velzen, B
    OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 565 - 573
  • [10] GRAPHS WHOSE VERTEX SET CAN BE PARTITIONED INTO A TOTAL DOMINATING SET AND AN INDEPENDENT DOMINATING SET
    Haynes, Teresa W.
    Henning, Michael A.
    OPUSCULA MATHEMATICA, 2024, 44 (04) : 543 - 563
12345