Parameterizations of hitting set of bundles and inverse scope

DOI10.1007/S10878-013-9629-5MaRDI QIDQ2344004zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 11 May 2015

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-013-9629-5

zbMATH Keywords

chemical reaction networkhitting setparameterized complexityW[i-hardness]

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On the minimum hitting set of bundles problem
• On the Minimum Hitting Set of Bundles Problem
• On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT
• On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
• Parameterized complexity of d-hitting set with quotas

Cites work

• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• An efficient fixed-parameter algorithm for 3-hitting set
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Multiple hypernode hitting sets and smallest two-cores with targets
• On the minimum hitting set of bundles problem
• Parameterized algorithmics for d-HITTING SET
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• The Turing way to parameterized complexity
• Treewidth governs the complexity of target set selection
• W-hierarchies defined by symmetric gates

Cited in

(5)

• On the minimum hitting set of bundles problem
• Minimum hitting set of interval bundles problem: computational complexity and approximability
• Parameterized dynamic variants of red-blue dominating set
• On the Minimum Hitting Set of Bundles Problem
• Attaining equilibria using control sets

This page was built for publication: Parameterizations of hitting set of bundles and inverse scope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344004)