Maximum diversity problem with squared euclidean distance › Research Explorer

Novosibirsk State University's Research Portal

Maximum diversity problem with squared euclidean distance

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-030-22629-9_38
Final published version

Anton V. Eremeev
Alexander V. Kel’manov
Mikhail Y. Kovalyov
Artem V. Pyatkin

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings
Editors	Michael Khachay, Panos Pardalos, Yury Kochetov
Publisher	Springer-Verlag GmbH and Co. KG
Pages	541-551
Number of pages	11
ISBN (Print)	9783030226282
DOIs	https://doi.org/10.1007/978-3-030-22629-9_38
Publication status	Published - 1 Jan 2019
Event	18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 - Ekaterinburg, Russian Federation Duration: 8 Jul 2019 → 12 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11548 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019
Country/Territory	Russian Federation
City	Ekaterinburg
Period	08.07.2019 → 12.07.2019

Research areas

Euclidean space, Exact algorithm, Fixed space dimension, Given size, Integer instance, Maximum variance, Pseudo-polynomial time, Strong NP-hardness, Subset of points, ALGORITHMS, SUBSET

ID: 20643987