Sciact
  • EN
  • RU

NP-hardness of Some Max-Min Clustering Problems Full article

Conference 9th International Conference on Optimization and Applications
01-05 Oct 2018 , Petrovac
Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2019, Pages: 144-154 Pages count : 11 DOI: 10.1007/978-3-030-10934-9_11
Tags Clustering; Euclidean space; Max-Min problem; NP-hardness; Quadratic variation
Authors Kel’manov Alexander 1,2 , Khandeev Vladimir 1,2 , Pyatkin Artem 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Kel’manov A. , Khandeev V. , Pyatkin A.
NP-hardness of Some Max-Min Clustering Problems
Communications in Computer and Information Science. 2019. P.144-154. DOI: 10.1007/978-3-030-10934-9_11 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85061209809
OpenAlex: W2910838307
Citing:
DB Citing
Scopus 1
OpenAlex 3
Altmetrics: