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 条
  • [1] Parameterized Complexity of d-Hitting Set with Quotas
    Gupta, Sushmita
    Jain, Pallavi
    Petety, Aditya
    Singh, Sagar
    SOFSEM 2021: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2021, 12607 : 293 - 307
  • [2] Parameterized algorithms for d-HITTING SET: The weighted case
    Fernau, Henning
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (16-18) : 1698 - 1713
  • [3] A kernelization algorithm for d-Hitting Set
    Abu-Khzam, Faisal N.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (07) : 524 - 531
  • [4] Kernelization algorithms for d-hitting set problems
    Abu-Khzam, Faisal N.
    Algorithms and Data Structures, Proceedings, 2007, 4619 : 434 - 445
  • [5] Towards Optimal and Expressive Kernelization for d-Hitting Set
    René van Bevern
    Algorithmica, 2014, 70 : 129 - 147
  • [6] Towards Optimal and Expressive Kernelization for d-Hitting Set
    van Bevern, Rene
    ALGORITHMICA, 2014, 70 (01) : 129 - 147
  • [7] NONBLOCKER: Parameterized algorithmics for MINIMUM DOMINATING SET
    Dehne, F
    Fellows, M
    Fernau, H
    Prieto, E
    Rosamond, F
    SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 237 - 245
  • [8] Optimal-size problem kernels for d-Hitting Set in linear time and space
    van Bevern, Rene
    Smirnov, Pavel V.
    INFORMATION PROCESSING LETTERS, 2020, 163
  • [9] Parameterized algorithms for HITTING SET: The weighted case
    Fernau, Henning
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 332 - 343
  • [10] A Kernelisation Approach for Multiple d-Hitting Set and Its Application in Optimal Multi-Drug Therapeutic Combinations
    Mellor, Drew
    Prieto, Elena
    Mathieson, Luke
    Moscato, Pablo
    PLOS ONE, 2010, 5 (10):
12345