Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667)
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: Complexity dichotomies for the \textsc{Minimum} F-\textsc{Overlay} problem |
scientific article; zbMATH DE number 7003354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem |
scientific article; zbMATH DE number 7003354 |
Statements
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (English)
0 references
18 January 2019
0 references
hypergraph
0 references
minimum \(\mathcal{F}\)-overlay problem
0 references
NP-completeness
0 references
fixed-parameter tractability
0 references
0 references
0.9924779534339904
0 references
0.853905439376831
0 references
0.8530979156494141
0 references
0.7450803518295288
0 references
0.7424741983413696
0 references
