Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem

The strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters of given sizes (cardinalities) minimizing the sum (over both clusters) of the intracluster sums of squared distances from the elements of the clusters to their centers is considered. It is assume...

Full description

Saved in:

Bibliographic Details
Published in:	Computational mathematics and mathematical physics Vol. 56; no. 2; pp. 334 - 341
Main Authors:	Kel’manov, A. V., Khandeev, V. I.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.02.2016 Springer Nature B.V
Subjects:	Algorithms Approximation Cluster analysis Clustering Clusters Computation Computational mathematics Computational Mathematics and Numerical Analysis Data analysis Euclidean geometry Euclidean space Hypotheses Hypothesis testing Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Origins Partitioning Studies NP-hardness minimum of the sum of squares of distances partition Euclidean space fixed space dimension cluster analysis FPTAS
ISSN:	0965-5425, 1555-6662
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!