Parameterized algorithmics for d-Hitting Set

被引：6
|
作者：
Fernau, Henning [1 ]
机构：
[1] Univ Trier, FB Abt Informat 4, D-54286 Trier, Germany
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2010年 / 87卷 / 14期
关键词：
Hitting Set problems; parameterized algorithms; analysis of search tree algorithms;
D O I：
10.1080/00207160903176868
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for d-Hitting Set. We considerably improve on the bounds that were elsewhere derived for these problems.
引用
收藏
页码：3157 / 3174
页数：18
相关论文
共 50 条
  • [31] On the parameterized complexity of d-dimensional point set pattern matching
    Cabello, Sergio
    Giannopoulos, Panos
    Knauer, Christian
    PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, 2006, 4169 : 175 - 183
  • [32] On the parameterized complexity of d-dimensional point set pattern matching
    Cabello, Sergio
    Giannopoulos, Panos
    Knauer, Christian
    INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 73 - 77
  • [33] The union of minimal hitting sets: Parameterized combinatorial bounds and counting
    Damaschke, Peter
    Molokov, Leonid
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 391 - 401
  • [34] Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
    Araujo, Julio
    Bougeret, Marin
    Campos, Victor A.
    Sau, Ignasi
    ALGORITHMICA, 2023, 85 (02) : 444 - 491
  • [35] Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
    Júlio Araújo
    Marin Bougeret
    Victor A. Campos
    Ignasi Sau
    Algorithmica, 2023, 85 : 444 - 491
  • [36] The union of minimal hitting sets: Parameterized combinatorial bounds and counting
    Damaschke, Peter
    STACS 2007, PROCEEDINGS, 2007, 4393 : 332 - 343
  • [37] Parameterized complexity of safe set
    Belmonte R.
    Hanaka T.
    Katsikarelis I.
    Lampis M.
    Ono H.
    Otachi Y.
    Journal of Graph Algorithms and Applications, 2020, 24 (03) : 215 - 245
  • [38] Parameterized Complexity of Safe Set
    Belmonte, Rémy
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Ono, Hirotaka
    Otachi, Yota
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, 11485 LNCS : 38 - 49
  • [39] Parameterized Complexity of Geodetic Set
    Kellerhals L.
    Koana T.
    Journal of Graph Algorithms and Applications, 2022, 26 (04) : 401 - 419
  • [40] The hitting set attack on anonymity protocols
    Kesdogan, D
    Pimenidis, L
    INFORMATION HIDING, 2004, 3200 : 326 - 339
12345