Computational Complexity of the Problem of Choosing Typical Representatives in a 2-Clustering of a Finite Set of Points in a Metric Space

Computational Complexity of the Problem of Choosing Typical Representatives in a 2-Clustering of a Finite Set of Points in a Metric Space Full article

Journal

Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797

Output data

Year: 2020, Volume: 14, Number: 2, Pages: 242-248 Pages count : 7 DOI: 10.1134/S1990478920020015

Authors

Borisova I.A. ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Funding (1)

Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, 630090, Russia

0314-2019-0015

Borisova I.A.
Computational Complexity of the Problem of Choosing Typical Representatives in a 2-Clustering of a Finite Set of Points in a Metric Space
Journal of Applied and Industrial Mathematics. 2020. V.14. N2. P.242-248. DOI: 10.1134/S1990478920020015 Scopus OpenAlex

Борисова И.А.
Вычислительная сложность задачи выбора типичных представителей в 2-разбиении конечного множества точек метрического пространства
Дискретный анализ и исследование операций. 2020. Т.27. №2. С.5-16.

≡ Scopus:	2-s2.0-85087761056
≡ OpenAlex:	W3041199422