arXiv
Open Access
2025
Faster parameterized algorithm for 3-Hitting Set
Dekel Tsur
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
D
Dekel Tsur
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2025
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓