@inproceedings{1711a0c75fab4aefb931ed8d008add6d,
title = "NP-hardness of some max-min clustering problems",
abstract = "We consider some consimilar problems of searching for disjoint clusters in the finite set of points in Euclidean space. The goal is to maximize the minimum subset size so that the value of each intracluster quadratic variation would not exceed a given constant. We prove that all considered problems are NP-hard even on a line.",
keywords = "Clustering, Euclidean space, Max-Min problem, NP-hardness, Quadratic variation",
author = "Alexander Kel{\textquoteright}manov and Vladimir Khandeev and Artem Pyatkin",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 9th International Conference on Optimization and Applications, OPTIMA 2018 ; Conference date: 01-10-2018 Through 05-10-2018",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-10934-9_11",
language = "English",
isbn = "9783030109332",
series = "Communications in Computer and Information Science",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "144--154",
editor = "Yury Kochetov and Michael Khachay and Yury Evtushenko and Vlasta Malkova and Mikhail Posypkin and Milojica Jacimovic",
booktitle = "Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers",
address = "Germany",
}