Sciact
Toggle navigation
  • EN
  • RU

Sections:

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

Articles (65)

# Публикация
61 Eremeev A.V. , Kelmanov A. , Pyatkin A.V.
On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction
Communications in Computer and Information Science. 2017. V.661. P.51-57. DOI: 10.1007/978-3-319-52920-2_5 Scopus OpenAlex
62 Eremeev A.V. , Kelmanov A.V. , Pyatkin A.V. , Ziegler I.A.
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum
Lecture Notes in Computer Science. 2017. P.142-151. DOI: 10.1007/978-3-319-73013-4_13 Scopus OpenAlex
63 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
64 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
65 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 65 records

Filter

Order

Field Direction

Columns

Reset