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

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...

Full description

Bibliographic Details

Published in:	Computational mathematics and mathematical physics Vol. 58; no. 1; pp. 130 - 136
Main Authors:	Kel’manov, A. V., Motkova, A. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.01.2018 Springer Nature B.V
Subjects:	Approximation Clustering Computational Mathematics and Numerical Analysis Euclidean geometry Euclidean space Mathematical analysis Mathematics Mathematics and Statistics Polynomials Ratios Sums NP-hardness Euclidean space weighted 2-clustering polynomial-time 2-approximation algorithm
ISSN:	0965-5425, 1555-6662
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!