On the Parameterized Complexity of the Expected Coverage Problem (Q5042243)
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: On the Parameterized Complexity of the Expected Coverage Problem |
scientific article; zbMATH DE number 7603924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Parameterized Complexity of the Expected Coverage Problem |
scientific article; zbMATH DE number 7603924 |
Statements
On the Parameterized Complexity of the Expected Coverage Problem (English)
0 references
19 October 2022
0 references
facility location
0 references
treewidth
0 references
W[1]-hard
0 references
subexponential parameterized algorithm
0 references
apex-minor-free graph
0 references
0 references
0 references
0 references
0 references
0 references
0.9832993149757384
0 references
0.8067090511322021
0 references
0.7819560170173645
0 references
0.7673603892326355
0 references
0.713112473487854
0 references
