Faster parameterized algorithm for 3-Hitting Set
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929671629701120 |
|---|---|
| author | Tsur, Dekel |
| author_facet | Tsur, Dekel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_06452 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Faster parameterized algorithm for 3-Hitting Set Tsur, Dekel Data Structures and Algorithms 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. |
| title | Faster parameterized algorithm for 3-Hitting Set |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2501.06452 |