Sciact
Toggle navigation
  • EN
  • RU

Sections:

  • Articles
  • Books
  • Conference attendances
  • Conference theses
  • Patents

Articles (66)

# Публикация
61 Ageev A. , Kel'manov A. , Pyatkin A. , Khamidullin S. , Shenmaier V.
1/2-Approximation polynomial-time algorithm for a problem of searching a subset
In compilation 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.8-12. DOI: 10.1109/sibircon.2017.8109827 WOS Scopus OpenAlex
62 Ageev A.A. , Kelmanov A.V. , Khamidullin S.A. , Pyatkin A. , Shenmaier V.V.
Approximation Algorithm for a Quadratic Euclidean Problem of Searching a Subset with the Largest Cardinality
CEUR Workshop Proceedings. 2017. V.1987. P.19-23. Scopus
63 Ageev A.A. , Kel’manov A.V. , Pyatkin A.V. , Khamidullin S.A. , Shenmaier V.V.
Approximation polynomial algorithm for the data editing and data cleaning problem
Pattern Recognition and Image Analysis. 2017. V.27. N3. P.365-370. DOI: 10.1134/s1054661817030038 Scopus OpenAlex
64 Ageev A.A. , Kel’manov A.V. , Pyatkin A.V.
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics. 2014. V.8. N4. P.453-457. DOI: 10.1134/s1990478914040012 Scopus OpenAlex
65 Ageev A.A. , Kel’manov A.V. , Pyatkin A.V.
NP-hardness of the Euclidean Max-Cut problem
Doklady Mathematics. 2014. V.89. N3. P.343-345. DOI: 10.1134/s1064562414030235 WOS Scopus OpenAlex
66 Ageev A.A. , Pyatkin A.V.
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
Lecture Notes in Computer Science. 2008. V.4927. P.103-115. DOI: 10.1007/978-3-540-77918-6_9 Scopus OpenAlex
  • « Previous
  • 1
  • 2
  • 3
  • 4
  • Next »
4   /  4   -  Total 66 records

Filter

Order

Field Direction

Columns

Reset