Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space

Journal

Computational Mathematics and Mathematical Physics
ISSN: 0965-5425 , E-ISSN: 1555-6662

Output data

Year: 2019, Volume: 59, Number: 5, Pages: 842-850 Pages count : 9 DOI: 10.1134/s0965542519050099

Authors

Kel’manov A.V. ^1,2 , Panasenko A.V. ^1,2 , Khandeev V.I. ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090 Russia
2	Novosibirsk State University, Novosibirsk, 630090 Russia

Kel’manov A.V. , Panasenko A.V. , Khandeev V.I.
Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space
Computational Mathematics and Mathematical Physics. 2019. V.59. N5. P.842-850. DOI: 10.1134/s0965542519050099 WOS Scopus Scopus OpenAlex

DB	Citing
OpenAlex	1
Scopus	1 9