The Problem K-Means and Given J-Centers › Research Explorer

Novosibirsk State University's Research Portal

The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

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

DOI

https://doi.org/10.1007/978-3-030-33394-2_16
Final published version

Alexander Kel’manov
Vladimir Khandeev

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers
Editors	Igor Bykadorov, Vitaly Strusevich, Tatiana Tchemisova
Publisher	Springer International Publishing AG
Pages	207-216
Number of pages	10
ISBN (Print)	9783030333935
DOIs	https://doi.org/10.1007/978-3-030-33394-2_16
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	Communications in Computer and Information Science
Volume	1090 CCIS
ISSN (Print)	1865-0929
ISSN (Electronic)	1865-0937

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, Minimum sum-of-squares clustering, One-dimensional case, Polynomial-time algorithm, Strongly NP-hard problem

ID: 22995093