The computational complexity and approximability of a series of geometric covering problems (Q483201)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity and approximability of a series of geometric covering problems |
scientific article |
Statements
The computational complexity and approximability of a series of geometric covering problems (English)
0 references
16 December 2014
0 references
NP-complete problem
0 references
polynomial-time reduction
0 references
MAX-SNP-hard problem
0 references
\(L\)-reduction
0 references
polynomial-time approximation scheme (PTAS)
0 references
0 references
