|
|||||
|
|
Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space |
|
| Authors: | Kel’manov A V Panasenko A V Khandeev V I |
| Institution: | 1.Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, 630090, Novosibirsk, Russia ;2.Novosibirsk State University, 630090, Novosibirsk, Russia ; |
| Abstract: | Computational Mathematics and Mathematical Physics - Two strongly NP-hard problems of clustering a finite set of points in Euclidean space are considered. In the first problem, given an input set,... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |