Geodesic
On the complexity of some cluster analysis problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 51 (2011) no. 11, pp. 2106-2112

Voir la notice de l'article provenant de la source Math-Net.Ru

NP-completeness of certain important clusterization problems for a finite set of vectors is proved. 
@article{ZVMMF_2011_51_11_a13,
     author = {A. V. Kel'manov},
     title = {On the complexity of some cluster analysis problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2106--2112},
     publisher = {mathdoc},
     volume = {51},
     number = {11},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_11_a13/}
}
TY  - JOUR
AU  - A. V. Kel'manov
TI  - On the complexity of some cluster analysis problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2011
SP  - 2106
EP  - 2112
VL  - 51
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_11_a13/
LA  - ru
ID  - ZVMMF_2011_51_11_a13
ER  - 
%0 Journal Article
%A A. V. Kel'manov
%T On the complexity of some cluster analysis problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2011
%P 2106-2112
%V 51
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_11_a13/
%G ru
%F ZVMMF_2011_51_11_a13
A. V. Kel'manov. On the complexity of some cluster analysis problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 51 (2011) no. 11, pp. 2106-2112. http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_11_a13/