The complexity of computing minimum separating polygons (Q4274652)
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 complexity of computing minimum separating polygons |
scientific article; zbMATH DE number 482411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing minimum separating polygons |
scientific article; zbMATH DE number 482411 |
Statements
The complexity of computing minimum separating polygons (English)
0 references
17 February 1994
0 references
minimum separating polygon
0 references
finite sets
0 references
NP-hard
0 references
0.8323377370834351
0 references
0.8031569123268127
0 references
0.8009265661239624
0 references
0.7948300242424011
0 references
