Document is current

Any future updates will be listed below

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

Crossref DOI link: https://doi.org/10.1134/S1990478920020039

Published Online: 2020-07-10

Published Print: 2020-05

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark