The complexity of computing minimum separating polygons (Q4274652): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:57, 6 February 2024
scientific article; zbMATH DE number 482411
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
