NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters › Research Explorer

Novosibirsk State University's Research Portal

NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1134/S1064562419050028
Final published version

A. V. Kel’manov
A. V. Pyatkin
V. I. Khandeev

Original language	English
Pages (from-to)	416-419
Number of pages	4
Journal	Doklady Mathematics
Volume	100
Issue number	2
DOIs	https://doi.org/10.1134/S1064562419050028
Publication status	Published - 1 Sept 2019

OECD FOS+WOS

ID: 22319261