## Abstract

A strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters is considered. The solution criterion is the minimum of the sum (over both clusters) of weighted sums of squared distances from the elements of each cluster to its geometric center. The weights of the sums are equal to the cardinalities of the desired clusters. The center of one cluster is given as input, while the center of the other is unknown and is determined as the point of space equal to the mean of the cluster elements. A version of the problem is analyzed in which the cardinalities of the clusters are given as input. A polynomial-time 2-approximation algorithm for solving the problem is constructed.

Original language | English |
---|---|

Pages (from-to) | 130-136 |

Number of pages | 7 |

Journal | Computational Mathematics and Mathematical Physics |

Volume | 58 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Jan 2018 |

## Keywords

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