Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems

DOI10.1016/0020-0190(86)90040-2zbMath0586.68035OpenAlexW2115345015MaRDI QIDQ1071507

Mirko Křivánek

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90040-2

zbMATH Keywords

polynomial transformationEuclidean clusteringexact cover by 3-sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Clustering to minimize the maximum intercluster distance
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems