Enumerating all minimal hitting sets in polynomial total time
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917857204371456 |
|---|---|
| author | Wild, Marcel |
| author_facet | Wild, Marcel |
| contents | Consider a hypergraph (=set system) $\mathbb{H}$ whose $h$ hyperedges are subsets of a set with w elements. We show that the $R$ minimal hitting sets of $\mathbb{H}$ can be enumerated in polynomial total time $O(Rh^2 w^2)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_07708 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Enumerating all minimal hitting sets in polynomial total time Wild, Marcel Combinatorics Data Structures and Algorithms Consider a hypergraph (=set system) $\mathbb{H}$ whose $h$ hyperedges are subsets of a set with w elements. We show that the $R$ minimal hitting sets of $\mathbb{H}$ can be enumerated in polynomial total time $O(Rh^2 w^2)$. |
| title | Enumerating all minimal hitting sets in polynomial total time |
| topic | Combinatorics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2303.07708 |