Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (Q1071507)
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: Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems |
scientific article; zbMATH DE number 3940720
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems |
scientific article; zbMATH DE number 3940720 |
Statements
Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (English)
0 references
1986
0 references
The special embedding of instances of the well-known NP-complete problem ''exact cover by 3-sets'' into hexagonal unit network is suggested for exhibiting polynomial transformation to geometric problems. In particular the NP-completeness of Euclidean clustering is proved and three interesting graph-theoretical corollaries are obtained.
0 references
exact cover by 3-sets
0 references
polynomial transformation
0 references
Euclidean clustering
0 references
0.7312095761299133
0 references
0.7257861495018005
0 references
0.7255280613899231
0 references