Enumerating all minimal hitting sets in polynomial total time

Enumerating all minimal hitting sets in polynomial total time

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)$.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Wild, Marcel
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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)$.
DOI:10.48550/arxiv.2303.07708