Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence › Research Explorer

Novosibirsk State University's Research Portal

Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence

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

DOI

https://doi.org/10.1007/978-3-030-05348-2_28
Final published version

Alexander Kel’manov
Sergey Khamidullin
Vladimir Khandeev
Artem Pyatkin

Original language	English
Title of host publication	Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers
Publisher	Springer-Verlag GmbH and Co. KG
Pages	326-336
Number of pages	11
ISBN (Print)	9783030053475
DOIs	https://doi.org/10.1007/978-3-030-05348-2_28
Publication status	Published - 1 Jan 2019
Event	12th International Conference on Learning and Intelligent Optimization, LION 12 - Kalamata, Greece Duration: 10 Jun 2018 → 15 Jun 2018

Publication series

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

Conference

Conference	12th International Conference on Learning and Intelligent Optimization, LION 12
Country/Territory	Greece
City	Kalamata
Period	10.06.2018 → 15.06.2018

Research areas

Euclidean space, Exact algorithm, Fixed space dimension, Integer coordinates, Largest set, Longest subsequence, NP-hard problem, Pseudopolynomial time, Quadratic variation

ID: 18142947