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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computational mathematics and mathematical physics Ročník 56; číslo 2; s. 334 - 341
Hlavní autoři:	Kel’manov, A. V., Khandeev, V. I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.02.2016 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!