Parameterized approximation algorithms for hitting set
From MaRDI portal
Recommendations
- Parameterized algorithmics for d-HITTING SET
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Parameterized algorithms for d-hitting set: the weighted case
- An efficient fixed-parameter algorithm for 3-hitting set
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
Cited in
(18)- Parameterized approximation via fidelity preserving transformations
- Approximation in (poly-) logarithmic space
- From causes for database queries to repairs and model-based diagnosis and back
- Parameterized algorithms and kernels for 3-hitting set with parity constraints
- Parameterized algorithmics for d-HITTING SET
- Parameterized approximation algorithms for packing problems
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Approximation algorithms in the successive hitting set model
- Asymptotically Optimal Hitting Sets Against Polynomials
- scientific article; zbMATH DE number 6829282 (Why is no real title available?)
- Towards optimal and expressive kernelization for \(d\)-hitting set
- Faster exponential-time approximation algorithms using approximate monotone local search
- Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems
- 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
- Data reductions and combinatorial bounds for improved approximation algorithms
- Parameterized algorithms for d-hitting set: the weighted case
This page was built for publication: Parameterized approximation algorithms for hitting set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896378)
