Parameterized algorithmics for d-HITTING SET
From MaRDI portal
Parameterized algorithmics for \(d\)-HITTING SET
Recommendations
Cited in
(18)- A variant of Reiter's hitting-set algorithm
- Parameterized top-\(K\) algorithms
- Parameterizations of hitting set of bundles and inverse scope
- From causes for database queries to repairs and model-based diagnosis and back
- A parameterized algorithm for bounded-degree vertex deletion
- Parameterized approximation algorithms for hitting set
- Parameterized algorithms and kernels for 3-hitting set with parity constraints
- Parameterized Algorithms for Hitting Set: The Weighted Case
- 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
- Generating Faster Algorithms for d-Path Vertex Cover
- On kernels for \(d\)-path vertex cover
- Faster parameterized algorithms for variants of \textsc{3-hitting set}
- Parameterized complexity of d-hitting set with quotas
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- An efficient fixed-parameter algorithm for 3-hitting set
- Parameterized algorithms for d-hitting set: the weighted case
- A kernelization algorithm for \(d\)-hitting set
This page was built for publication: Parameterized algorithmics for \(d\)-HITTING SET
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066963)