Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry |
scientific article; zbMATH DE number 5798530
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry |
scientific article; zbMATH DE number 5798530 |
Statements
Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (English)
0 references
11 October 2010
0 references
hypergraphs
0 references
transversals
0 references
geometric hitting sets
0 references
enumeration algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.89554596
0 references
0.8896833
0 references
0.87871164
0 references
0.8748563
0 references
0.87095636
0 references
0.8696405
0 references
0.86837435
0 references
0.86837435
0 references
0.8672103
0 references
0.8653195
0 references
