Matches in SemOpenAlex for { <https://semopenalex.org/work/W4298417607> ?p ?o ?g. }
Showing items 1 to 64 of
64
with 100 items per page.
- W4298417607 abstract "The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polynomial time. For hypergraphs whose solutions have bounded size, Eiter and Gottlob [SICOMP 1995] gave an algorithm that runs in output-polynomial time, but whose space requirement also scales with the output size. We improve this to polynomial delay and polynomial space. More generally, we present an algorithm that on $n$-vertex, $m$-edge hypergraphs has delay $O(m^{k^*+1} n^2)$ and uses $O(mn)$ space, where $k^*$ is the maximum size of any minimal hitting set. Our algorithm is oblivious to $k^*$, a quantity that is hard to compute or even approximate. Central to our approach is the extension problem for minimal hitting sets, deciding for a set $X$ of vertices whether it is contained in any solution. With $|X|$ as parameter, we show that this is one of the first natural problems to be complete for the complexity class $W[3]$. We give an algorithm for the extension problem running in time $O(m^{|X|+1} n)$. We also prove a conditional lower bound under the Strong Exponential Time Hypothesis, showing that this is close to optimal. We apply our enumeration method to the discovery problem of minimal unique column combinations from data profiling. Our empirical evaluation suggests that the algorithm outperforms its worst-case guarantees on hypergraphs stemming from real-world databases." @default.
- W4298417607 created "2022-10-02" @default.
- W4298417607 creator A5008898604 @default.
- W4298417607 creator A5053839092 @default.
- W4298417607 creator A5058590949 @default.
- W4298417607 creator A5077389210 @default.
- W4298417607 creator A5088807601 @default.
- W4298417607 date "2018-05-03" @default.
- W4298417607 modified "2023-09-26" @default.
- W4298417607 title "Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling" @default.
- W4298417607 doi "https://doi.org/10.48550/arxiv.1805.01310" @default.
- W4298417607 hasPublicationYear "2018" @default.
- W4298417607 type Work @default.
- W4298417607 citedByCount "0" @default.
- W4298417607 crossrefType "posted-content" @default.
- W4298417607 hasAuthorship W4298417607A5008898604 @default.
- W4298417607 hasAuthorship W4298417607A5053839092 @default.
- W4298417607 hasAuthorship W4298417607A5058590949 @default.
- W4298417607 hasAuthorship W4298417607A5077389210 @default.
- W4298417607 hasAuthorship W4298417607A5088807601 @default.
- W4298417607 hasBestOaLocation W42984176071 @default.
- W4298417607 hasConcept C11413529 @default.
- W4298417607 hasConcept C114614502 @default.
- W4298417607 hasConcept C118615104 @default.
- W4298417607 hasConcept C132525143 @default.
- W4298417607 hasConcept C134306372 @default.
- W4298417607 hasConcept C179799912 @default.
- W4298417607 hasConcept C197685441 @default.
- W4298417607 hasConcept C2781221856 @default.
- W4298417607 hasConcept C311688 @default.
- W4298417607 hasConcept C33923547 @default.
- W4298417607 hasConcept C34388435 @default.
- W4298417607 hasConcept C63553672 @default.
- W4298417607 hasConcept C80899671 @default.
- W4298417607 hasConceptScore W4298417607C11413529 @default.
- W4298417607 hasConceptScore W4298417607C114614502 @default.
- W4298417607 hasConceptScore W4298417607C118615104 @default.
- W4298417607 hasConceptScore W4298417607C132525143 @default.
- W4298417607 hasConceptScore W4298417607C134306372 @default.
- W4298417607 hasConceptScore W4298417607C179799912 @default.
- W4298417607 hasConceptScore W4298417607C197685441 @default.
- W4298417607 hasConceptScore W4298417607C2781221856 @default.
- W4298417607 hasConceptScore W4298417607C311688 @default.
- W4298417607 hasConceptScore W4298417607C33923547 @default.
- W4298417607 hasConceptScore W4298417607C34388435 @default.
- W4298417607 hasConceptScore W4298417607C63553672 @default.
- W4298417607 hasConceptScore W4298417607C80899671 @default.
- W4298417607 hasLocation W42984176071 @default.
- W4298417607 hasLocation W42984176072 @default.
- W4298417607 hasOpenAccess W4298417607 @default.
- W4298417607 hasPrimaryLocation W42984176071 @default.
- W4298417607 hasRelatedWork W1869960717 @default.
- W4298417607 hasRelatedWork W2018766465 @default.
- W4298417607 hasRelatedWork W2043294549 @default.
- W4298417607 hasRelatedWork W2075130353 @default.
- W4298417607 hasRelatedWork W2224556402 @default.
- W4298417607 hasRelatedWork W3188963412 @default.
- W4298417607 hasRelatedWork W4221157390 @default.
- W4298417607 hasRelatedWork W4297781165 @default.
- W4298417607 hasRelatedWork W4306705875 @default.
- W4298417607 hasRelatedWork W2162198520 @default.
- W4298417607 isParatext "false" @default.
- W4298417607 isRetracted "false" @default.
- W4298417607 workType "article" @default.