On the Complexity of Nonconvex Covering (Q3740282)
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 Complexity of Nonconvex Covering |
scientific article; zbMATH DE number 3974352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Nonconvex Covering |
scientific article; zbMATH DE number 3974352 |
Statements
On the Complexity of Nonconvex Covering (English)
0 references
1986
0 references
NP-completeness
0 references
computational geometry
0 references
polynomial time algorithm
0 references
robotics
0 references
degree of nonconvexity
0 references
0.8005273938179016
0 references
0.7795169949531555
0 references
0.7792696356773376
0 references
0.764039933681488
0 references
