Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence Full article
| Journal |
Annals of Mathematics and Artificial Intelligence
ISSN: 1012-2443 , E-ISSN: 1573-7470 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2019, Volume: 88, Number: 1-3, Pages: 157-168 Pages count : 12 DOI: 10.1007/s10472-019-09623-z | ||||
| Tags | Euclidean space; Exact algorithm; Largest subset; Longest subsequence; Pseudopolynomial time; Quadratic variation | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Kel’manov A.
, Khamidullin S.
, Khandeev V.
, Pyatkin A.
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
Annals of Mathematics and Artificial Intelligence. 2019. V.88. N1-3. P.157-168. DOI: 10.1007/s10472-019-09623-z WOS Scopus OpenAlex
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
Annals of Mathematics and Artificial Intelligence. 2019. V.88. N1-3. P.157-168. DOI: 10.1007/s10472-019-09623-z WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000512057700009 |
| Scopus: | 2-s2.0-85063124993 |
| OpenAlex: | W2924034761 |