An approximation polynomial algorithm for a problem of searching for the longest subsequence in a finite sequence of points in euclidean space › Research Explorer

Novosibirsk State University's Research Portal

An approximation polynomial algorithm for a problem of searching for the longest subsequence in a finite sequence of points in euclidean space

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

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-319-93800-4_10
Final published version

Alexander Kel’manov
Artem Pyatkin
Sergey Khamidullin
Vladimir Khandeev
Yury V. Shamardin
Vladimir Shenmaier

Original language	English
Title of host publication	Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers
Publisher	Springer-Verlag GmbH and Co. KG
Pages	120-130
Number of pages	11
ISBN (Print)	9783319937991
DOIs	https://doi.org/10.1007/978-3-319-93800-4_10
Publication status	Published - 1 Jan 2018
Event	7th International Conference on Optimization Problems and Their Applications, OPTA 2018 - Omsk, Russian Federation Duration: 8 Jun 2018 → 14 Jun 2018

Publication series

Name	Communications in Computer and Information Science
Volume	871
ISSN (Print)	1865-0929

Conference

Conference	7th International Conference on Optimization Problems and Their Applications, OPTA 2018
Country/Territory	Russian Federation
City	Omsk
Period	08.06.2018 → 14.06.2018

Research areas

Euclidean space, Longest subsequence, NP-hard problem, Polynomial-time approximation algorithm, Quadratic variation

ID: 14464486