Complexity of certain problems of searching for subsets of vectors and cluster analysis |
| |
Authors: | A V Kel’manov A V Pyatkin |
| |
Institution: | 1.Sobolev Institute of Mathematics, Siberian Branch,Russian Academy of Sciences,Novosibirsk,Russia |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|