On the Complexity of SomeMax-Min Clustering Problems

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	S65-S73
Number of pages	9
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	309
Issue number	SUPPL 1
DOIs	https://doi.org/10.1134/S0081543820040082
Publication status	Published - Aug 2020

Euclidean space, clustering, max-min problem, quadratic variation, NP-hardness, NP-HARDNESS, max–min problem

ID: 26085181