On the Complexity of SomeMax–Min Clustering Problems Full article
| Journal |
Proceedings of the Steklov Institute of Mathematics
ISSN: 0081-5438 , E-ISSN: 1531-8605 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2020, Volume: 309, Number: S1, Pages: S65-S73 Pages count : DOI: 10.1134/s0081543820040082 | ||||
| Tags | clustering; Euclidean space; max–min problem; NP-hardness; quadratic variation | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Kel’manov A.V.
, Pyatkin A.V.
, Khandeev V.I.
On the Complexity of SomeMax–Min Clustering Problems
Proceedings of the Steklov Institute of Mathematics. 2020. V.309. NS1. P.S65-S73. DOI: 10.1134/s0081543820040082 WOS Scopus OpenAlex
On the Complexity of SomeMax–Min Clustering Problems
Proceedings of the Steklov Institute of Mathematics. 2020. V.309. NS1. P.S65-S73. DOI: 10.1134/s0081543820040082 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000563174400007 |
| Scopus: | 2-s2.0-85140577971 |
| OpenAlex: | W3080082180 |