Parameterizations of hitting set of bundles and inverse scope

Peter Damaschke ()
Additional contact information
Peter Damaschke: Chalmers University

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 12, 847-858

Abstract: Abstract 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]$$ 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]$$ 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.

Keywords: Hitting set; Parameterized complexity; W[i]-hardness; Chemical reaction network (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9629-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9629-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9629-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().