Parameterized algorithmics for d-H<scp>itting</scp> S<scp>et</scp>

DOI10.1080/00207160903176868zbMath1216.68360OpenAlexW2063292059MaRDI QIDQ3066963

Henning Fernau

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903176868

zbMATH Keywords

parameterized algorithmshitting set problemsanalysis of search tree algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Combinatorial optimization (90C27)

Related Items (3)

From causes for database queries to repairs and model-based diagnosis and back ⋮ A Parameterized Algorithm for Bounded-Degree Vertex Deletion ⋮ Parameterizations of hitting set of bundles and inverse scope

This page was built for publication: Parameterized algorithmics for d-H<scp>itting</scp> S<scp>et</scp>