Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case

Alexander Kel'manov, Vladimir I. Khandeev. Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case. In Yaroslav D. Sergeyev, Dmitri E. Kvasov, editors, Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II. Volume 11974 of Lecture Notes in Computer Science, pages 394-399, Springer, 2019. [doi]

@inproceedings{KelmanovK19-1,
  title = {Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case},
  author = {Alexander Kel'manov and Vladimir I. Khandeev},
  year = {2019},
  doi = {10.1007/978-3-030-40616-5_35},
  url = {https://doi.org/10.1007/978-3-030-40616-5_35},
  researchr = {https://researchr.org/publication/KelmanovK19-1},
  cites = {0},
  citedby = {0},
  pages = {394-399},
  booktitle = {Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II},
  editor = {Yaroslav D. Sergeyev and Dmitri E. Kvasov},
  volume = {11974},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-40616-5},
}