Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence | Sciact - Система учета научной деятельности ИМ СО РАН

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence Научная публикация

Журнал

Annals of Mathematics and Artificial Intelligence
ISSN: 1012-2443 , E-ISSN: 1573-7470

Вых. Данные

Год: 2019, Том: 88, Номер: 1-3, Страницы: 157-168 Страниц : 12 DOI: 10.1007/s10472-019-09623-z

Ключевые слова

Euclidean space; Exact algorithm; Largest subset; Longest subsequence; Pseudopolynomial time; Quadratic variation

Авторы

Kel’manov Alexander ^1,2 , Khamidullin Sergey ^1,2 , Khandeev Vladimir ^1,2 , Pyatkin Artem ^1,2

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

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

Web of science:	WOS:000512057700009
Scopus:	2-s2.0-85063124993
OpenAlex:	W2924034761

БД	Цитирований
Scopus	1
OpenAlex	1