Dynamic kernels for hitting sets and set packing

DOI10.4230/LIPICS.IPEC.2021.7MaRDI QIDQ6192475zbMATH OpenFDO

Authors Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau

Publication date 12 February 2024

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2021.7

zbMATH Keywords

dynamic algorithmshitting setkernelizationset packings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Recommendations

• Dynamic kernels for hitting sets and set packing
• Kernelization Algorithms for d-Hitting Set Problems
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
• Computing Hitting Set Kernels By AC^0-Circuits
• A kernelization algorithm for \(d\)-hitting set

Cited in

(1)

• Dynamic kernels for hitting sets and set packing

This page was built for publication: Dynamic kernels for hitting sets and set packing

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