Geodesic
Complexity of certain problems of searching for subsets of vectors and cluster analysis
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 11, pp. 2059-2065

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

The discrete extremal problems to which certain problems of searching for subsets of vectors and cluster analysis are reduced are proved to be NP-complete. 
@article{ZVMMF_2009_49_11_a11,
     author = {A. V. Kel'manov and A. V. Pyatkin},
     title = {Complexity of certain problems of searching for subsets of vectors and cluster analysis},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2059--2065},
     publisher = {mathdoc},
     volume = {49},
     number = {11},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_11_a11/}
}
TY  - JOUR
AU  - A. V. Kel'manov
AU  - A. V. Pyatkin
TI  - Complexity of certain problems of searching for subsets of vectors and cluster analysis
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2009
SP  - 2059
EP  - 2065
VL  - 49
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_11_a11/
LA  - ru
ID  - ZVMMF_2009_49_11_a11
ER  - 
%0 Journal Article
%A A. V. Kel'manov
%A A. V. Pyatkin
%T Complexity of certain problems of searching for subsets of vectors and cluster analysis
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2009
%P 2059-2065
%V 49
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_11_a11/
%G ru
%F ZVMMF_2009_49_11_a11
A. V. Kel'manov; A. V. Pyatkin. Complexity of certain problems of searching for subsets of vectors and cluster analysis. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 11, pp. 2059-2065. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_11_a11/