Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized counting matching and packing: a family of hard problems that admit FPTRAS |
scientific article |
Statements
Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (English)
0 references
5 June 2018
0 references
counting
0 references
matching and packing
0 references
computational complexity
0 references
FPTRAS
0 references
