Fast and exact algorithms for some NP-hard 2-clustering problems in the one-dimensional case › Research Explorer

Novosibirsk State University's Research Portal

Fast and exact algorithms for some NP-hard 2-clustering problems in the one-dimensional case

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

DOI

https://doi.org/10.1007/978-3-030-37334-4_34
Final published version

Alexander Kel’manov
Vladimir Khandeev

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 8th International Conference, AIST 2019, Revised Selected Papers
Editors	Wil M.P. van der Aalst, Vladimir Batagelj, Dmitry I. Ignatov, Valentina Kuskova, Sergei O. Kuznetsov, Irina A. Lomazova, Michael Khachay, Andrey Kutuzov, Natalia Loukachevitch, Amedeo Napoli, Panos M. Pardalos, Marcello Pelillo, Andrey V. Savchenko, Elena Tutubalina
Publisher	Springer International Publishing AG
Pages	377-387
Number of pages	11
ISBN (Print)	9783030373337
DOIs	https://doi.org/10.1007/978-3-030-37334-4_34
Publication status	Published - 1 Jan 2019
Event	8th International Conference on Analysis of Images, Social Networks and Texts, AIST 2019 - Kazan, Russian Federation Duration: 17 Jul 2019 → 19 Jul 2019

Publication series

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

Conference

Conference	8th International Conference on Analysis of Images, Social Networks and Texts, AIST 2019
Country/Territory	Russian Federation
City	Kazan
Period	17.07.2019 → 19.07.2019

Research areas

2-clustering, 2-partitioning, Euclidean space, Fast exact algorithms, NP-hardness, Polynomial-time solvability in the 1D case

ID: 23144199