Journal article, 2015

Hitting Set of Bundles generalizes the ordinary Hitting Set
problem in the way that prescribed bundles of elements rather than single elements have to be put in a hitting set. The goal is to minimize the total number of distinct elements in the solution. First we prove that Hitting
Set of Bundles, with the number of hyperedges and the solution size as parameter, is W[1]-complete. This contrasts to the to the corresponding parameterized Hitting Set version which is in FPT. Then we use this result to prove W[i]-hardness also for the Inverse Scope problem and
some of its variants. This problem asks to identify small sets of chemical reactants being able to produce a given set of target compounds in a network of reactions. The problem has a graph-theoretic formulation as a reachability
problem in directed graphs. On the positive side, we give an FPT algorithm where the parameter is the total number of compounds involved in the reactions.

W[i]-hardness

hitting set

parameterized complexity

chemical reaction network

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

1382-6905 (ISSN) 1573-2886 (eISSN)

Vol. 29 4 847-855Basic sciences

Bioinformatics (Computational Biology)

Computer Science

Discrete Mathematics

Life Science Engineering (2010-2018)

10.1007/s10878-013-9629-5