An approximation algorithm for solving a problem of cluster analysis
- 1 October 2011
- journal article
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 5 (4), 551-558
- https://doi.org/10.1134/s1990478911040107
Abstract
The authors provide some 2-approximation algorithm for an intractable problem to which one can reduce the problem of partitioning a vector set in Euclidean space into the two subsets (clusters) having the minimum sum of distance squares.Keywords
This publication has 4 references indexed in Scilit:
- On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimensionJournal of Applied and Industrial Mathematics, 2010
- On two problems of choosing some subset of vectors with integer coordinates that has maximum norm of the sum of elements in Euclidean spaceJournal of Applied and Industrial Mathematics, 2009
- The problem of finding a subset of vectors with the maximum total weightJournal of Applied and Industrial Mathematics, 2008
- Table of contentsIEEE Transactions on Signal Processing, 2004