Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center

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

Original language	English
Pages (from-to)	130-136
Number of pages	7
Journal	Computational Mathematics and Mathematical Physics
Volume	58
Issue number	1
DOIs	https://doi.org/10.1134/S0965542518010074
Publication status	Published - 1 Jan 2018

Euclidean space, NP-hardness, polynomial-time 2-approximation algorithm, weighted 2-clustering

ID: 10496999