Exact algorithms for the special cases of two hard to solve problems of searching for the largest subset › Research Explorer

Novosibirsk State University's Research Portal

Exact algorithms for the special cases of two hard to solve problems of searching for the largest subset

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

DOI

https://doi.org/10.1007/978-3-030-11027-7_28
Final published version

Alexander Kel’manov
Vladimir Khandeev
Anna Panasenko

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers
Editors	Alexander Panchenko, Wil M. van der Aalst, Michael Khachay, Panos M. Pardalos, Vladimir Batagelj, Natalia Loukachevitch, Goran Glavaš, Dmitry I. Ignatov, Sergei O. Kuznetsov, Olessia Koltsova, Irina A. Lomazova, Andrey V. Savchenko, Amedeo Napoli, Marcello Pelillo
Publisher	Springer-Verlag GmbH and Co. KG
Pages	294-304
Number of pages	11
ISBN (Print)	9783030110260
DOIs	https://doi.org/10.1007/978-3-030-11027-7_28
Publication status	Published - 1 Jan 2018
Event	7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018 - Moscow, Russian Federation Duration: 5 Jul 2018 → 7 Jul 2018

Publication series

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

Conference

Conference	7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018
Country/Territory	Russian Federation
City	Moscow
Period	05.07.2018 → 07.07.2018

Research areas

2-clustering, Euclidean space, Exact algorithm, Largest subset, NP-hardness, Pseudopolynomial-time solvability

ID: 18489624