The computational complexity and approximability of a series of geometric covering problems (Q483201): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s008154381309006x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2105177507 / rank | |||
Normal rank | |||
Latest revision as of 08:35, 30 July 2024
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
