Exact Algorithms of Search for a Cluster of the Largest Size in Two Integer 2-Clustering Problems

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

Original language	English
Pages (from-to)	105-115
Number of pages	11
Journal	Numerical Analysis and Applications
Volume	12
Issue number	2
DOIs	https://doi.org/10.1134/S1995423919020010
Publication status	Published - 1 Apr 2019

2-clustering, Euclidean space, exact algorithm, largest subset, NP-hardness, pseudopolynomial-time solvability

ID: 20537513