Faster parameterized algorithms for variants of \textsc{3-hitting set}

DOI10.1007/S10878-025-01300-8MaRDI QIDQ6976868zbMATH OpenFDO

Authors Dekel Tsur

Publication date 31 May 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10878-025-01300-8

zbMATH Keywords

branching algorithmsgraph algorithmsparameterized complexity

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• An efficient fixed-parameter algorithm for 3-hitting set
• Fixed-parameter tractability results for feedback set problems in tournaments
• Iterative compression and exact algorithms
• Parameterized algorithmics for d-HITTING SET
• Parameterized algorithms
• Parameterized algorithms and kernels for 3-hitting set with parity constraints
• Parameterized approximation via fidelity preserving transformations
• Parameterized complexity of d-hitting set with quotas
• The approximability of constraint satisfaction problems

This page was built for publication: Faster parameterized algorithms for variants of \textsc{3-hitting set}

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