The computational complexity and approximability of a series of geometric covering problems (Q483201)
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: The computational complexity and approximability of a series of geometric covering problems |
scientific article; zbMATH DE number 6380784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity and approximability of a series of geometric covering problems |
scientific article; zbMATH DE number 6380784 |
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
