Approximate Algorithms for Some Maximin Clustering Problems › Research Explorer

Novosibirsk State University's Research Portal

Approximate Algorithms for Some Maximin Clustering Problems

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

Department of Mechanics and Mathematics

DOI

https://doi.org/10.1007/978-3-031-16224-4_6
Final published version

Vladimir Khandeev
Sergey Neshchadim

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research
Subtitle of host publication	Recent Trends - 21st International Conference, MOTOR 2022, Revised Selected Papers
Editors	Yury Kochetov, Anton Eremeev, Oleg Khamisov, Anna Rettieva
Publisher	Springer Science and Business Media Deutschland GmbH
Chapter	6
Pages	89-103
Number of pages	15
ISBN (Print)	9783031162237
DOIs	https://doi.org/10.1007/978-3-031-16224-4_6
Publication status	Published - 2022
Event	21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022 - Petrozavodsk, Russian Federation Duration: 2 Jul 2022 → 6 Jul 2022

Publication series

Name	Communications in Computer and Information Science
Volume	1661 CCIS
ISSN (Print)	1865-0929
ISSN (Electronic)	1865-0937

Conference

Conference	21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022
Country/Territory	Russian Federation
City	Petrozavodsk
Period	02.07.2022 → 06.07.2022

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES
1.01 MATHEMATICS

Research areas

Approximation algorithm, Bounded scatter, Clustering, Euclidean space, Max-min problem, NP-hardness

ID: 38414993