You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
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
Springer, Cham, June 2018
Alexander Kel’manov, Artem Pyatkin, Sergey Khamidullin, Vladimir Khandeev, Yury V. Shamardin, Vladimir Shenmaier
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Readers by discipline||Count||As %|