An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space Научная публикация
| Конференция |
Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 июл. 2018 , Омск |
||||
|---|---|---|---|---|---|
| Журнал |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Вых. Данные | Год: 2018, Страницы: 120-130 Страниц : 11 DOI: 10.1007/978-3-319-93800-4_10 | ||||
| Ключевые слова | Euclidean space; Longest subsequence; NP-hard problem; Polynomial-time approximation algorithm; Quadratic variation | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Kel’manov A.
, Pyatkin A.
, Khamidullin S.
, Khandeev V.
, Shamardin Y.V.
, Shenmaier V.
An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space
Communications in Computer and Information Science. 2018. P.120-130. DOI: 10.1007/978-3-319-93800-4_10 Scopus OpenAlex
An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space
Communications in Computer and Information Science. 2018. P.120-130. DOI: 10.1007/978-3-319-93800-4_10 Scopus OpenAlex
Идентификаторы БД:
| Scopus: | 2-s2.0-85049671805 |
| OpenAlex: | W2808192002 |