An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space Full article
| Conference |
Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 Jul 2018 , Омск |
||||
|---|---|---|---|---|---|
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Output data | Year: 2018, Pages: 120-130 Pages count : 11 DOI: 10.1007/978-3-319-93800-4_10 | ||||
| Tags | Euclidean space; Longest subsequence; NP-hard problem; Polynomial-time approximation algorithm; Quadratic variation | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
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
Identifiers:
| Scopus: | 2-s2.0-85049671805 |
| OpenAlex: | W2808192002 |