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 条
  • [41] On the Minimum Hitting Set of Bundles problem
    Angel, Eric
    Bampis, Evripidis
    Gourves, Laurent
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 3 - +
  • [42] IMPROVED HITTING SET FOR ORBIT OF ROABPS
    Bhargava, Vishwas
    Ghosh, Sumanta
    COMPUTATIONAL COMPLEXITY, 2022, 31 (02)
  • [43] Planted hitting set recovery in hypergraphs
    Amburg, Ilya
    Kleinberg, Jon
    Benson, Austin R.
    JOURNAL OF PHYSICS-COMPLEXITY, 2021, 2 (03):
  • [44] Parameterized complexity of safe set
    Belmonte, Rémy
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Ono, Hirotaka
    Otachi, Yota
    arXiv, 2019,
  • [45] Constrained Hitting Set Problem with Intervals
    Acharyya, Ankush
    Keikha, Vahideh
    Majumdar, Diptapriyo
    Pandit, Supantha
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 604 - 616
  • [46] Reconstructive Dispersers and Hitting Set Generators
    Umans, Christopher
    ALGORITHMICA, 2009, 55 (01) : 134 - 156
  • [47] Reconstructive Dispersers and Hitting Set Generators
    Christopher Umans
    Algorithmica, 2009, 55 : 134 - 156
  • [48] Reconstructive dispersers and hitting set generators
    Umans, C
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 460 - 471
  • [49] Improved Hitting Set for Orbit of ROABPs
    Vishwas Bhargava
    Sumanta Ghosh
    computational complexity, 2022, 31
  • [50] On the minimum hitting set of bundles problem
    Angel, Eric
    Bampis, Evripidis
    Gourves, Laurent
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (45) : 4534 - 4542
12345