RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2016 Volume 23, Issue 3, Pages 21–34 (Mi da850)

This article is cited in 15 papers

Exact pseudopolinomial algorithms for a balanced $2$-clustering problem

A. V. Kel'manovab, A. V. Motkovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We consider the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters so as to minimize the sum (over both clusters) of the weighted sum of the squared intracluster distances from the elements of the clusters to their centers. The weights of sums are the sizes of the clusters. The center of one cluster is given as input, while the center of the other cluster is unknown and determined as the average value over all points in the cluster (the geometric center). The two versions of the problems are analyzed in which the cluster sizes are either parts of the input or optimization variables. We present and prove exact pseudopolynomial algorithms in the case of integer components of the input points and fixed space dimension. Bibliogr. 24.

Keywords: Euclidean space, balanced clustering, NP-hardness, integer inputs, fixed space dimension, exact pseudopolynomial algorithm.

UDC: 519.16+519.85

Received: 25.05.2016

DOI: 10.17377/daio.2016.23.520


 English version:
Journal of Applied and Industrial Mathematics, 2016, 10:3, 349–355

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025