Parameterizations of hitting set of bundles and inverse scope

DOI10.1007/s10878-013-9629-5zbMath1321.90143OpenAlexW2067534067MaRDI QIDQ2344004

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

parameterized complexitychemical reaction networkhitting setW[i-hardness]

Mathematics Subject Classification ID

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

Related Items (2)

Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ Parameterized Dynamic Variants of Red-Blue Dominating Set

Cites Work

• Unnamed Item
• Treewidth governs the complexity of target set selection
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• An efficient fixed-parameter algorithm for 3-hitting set
• W-hierarchies defined by symmetric gates
• On the minimum hitting set of bundles problem
• Multiple hypernode hitting sets and smallest two-cores with targets
• The Turing way to parameterized complexity
• Parameterized algorithmics for d-H<scp>itting</scp> S<scp>et</scp>

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