An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space
Crossref DOI link: https://doi.org/10.1007/978-3-319-93800-4_10
Published Online: 2018-06-17
Published Print: 2018
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kel’manov, Alexander
Pyatkin, Artem
Khamidullin, Sergey
Khandeev, Vladimir
Shamardin, Yury V.
Shenmaier, Vladimir
License valid from 2018-01-01