Work

Faster parameterized algorithm for 3-Hitting Set

Year: 2025
Type: preprint
Abstract: In the 3-Hitting Set problem, the input is a hypergraph $G$ such that the size of every hyperedge of $G$ is at most 3, and an integers $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that every hyperedge of $G$ contains at least one vertex from $S$. In this paper we give an $O^*(2.0409^k)$-time algorithm for 3-Hitting Set.
Author: Tsur, Dekel
Language: English
Open Access status: green
OpenAlex ID: W6948338415
Cites: 19
Cited by: 3
Related to: 10