|
1
|
Panasenko A.
Approximation Scheme for a Sequence Weighted 2-Clustering with a Fixed Center of One Cluster
In compilation
Mathematical Optimization Theory and Operations Research: Recent Trends.
– Springer.,
2024.
– Т.2239. – C.349–360. – ISBN 978-3-031-73364-2. DOI: 10.1007/978-3-031-73365-9_24
Scopus
OpenAlex
|
|
2
|
Kel’manov A.
, Khamidullin S.
, Panasenko A.
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
Lecture Notes in Computer Science. 2020.
P.386-393. DOI: 10.1007/978-3-030-40616-5_34
Scopus
OpenAlex
|
|
3
|
Kel’manov A.
, Khamidullin S.
, Panasenko A.
Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence
Lecture Notes in Computer Science. 2020.
P.135-145. DOI: 10.1007/978-3-030-38629-0_11
Scopus
OpenAlex
|
|
4
|
Khamidullin S.
, Khandeev V.
, Panasenko A.
Randomized Algorithms for Some Sequence Clustering Problems
Lecture Notes in Computer Science. 2020.
P.96-101. DOI: 10.1007/978-3-030-53552-0_11
Scopus
OpenAlex
|
|
5
|
Khandeev V.
, Panasenko A.
Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
Communications in Computer and Information Science. 2020.
P.30-35. DOI: 10.1007/978-3-030-58657-7_4
Scopus
OpenAlex
|
|
6
|
Panasenko A.
A PTAS for One Cardinality-Weighted 2-Clustering Problem
Lecture Notes in Computer Science. 2019.
P.581-592. DOI: 10.1007/978-3-030-22629-9_41
Scopus
OpenAlex
|
|
7
|
Kel′manov A.V.
, Panasenko A.V.
, Khandeev V.I.
Exact Algorithms of Search for a Cluster of the Largest Size in Two Integer 2-Clustering Problems
Numerical Analysis and Applications. 2019.
V.12. N2. P.105-115. DOI: 10.1134/s1995423919020010
WOS
Scopus
OpenAlex
|
|
8
|
Kel’manov A.V.
, Panasenko A.V.
, Khandeev V.I.
Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space
Computational Mathematics and Mathematical Physics. 2019.
V.59. N5. P.842-850. DOI: 10.1134/s0965542519050099
WOS
Scopus
Scopus
OpenAlex
|
|
9
|
Kel’manov A.
, Khandeev V.
, Panasenko A.
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset
Lecture Notes in Computer Science. 2018.
P.294-304. DOI: 10.1007/978-3-030-11027-7_28
Scopus
OpenAlex
|
|
10
|
Kel’manov A.
, Khandeev V.
, Panasenko A.
Randomized Algorithms for Some Clustering Problems
Communications in Computer and Information Science. 2018.
P.109-119. DOI: 10.1007/978-3-319-93800-4_9
OpenAlex
|
|
11
|
Kel’manov A.V.
, Motkova A.V.
Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center
Computational Mathematics and Mathematical Physics. 2018.
V.58. N1. P.130-136. DOI: 10.1134/s0965542518010074
WOS
Scopus
OpenAlex
|
|
12
|
Kel’manov A.V.
, Motkova A.V.
Approximation Scheme for a Quadratic Euclidean Weighted 2-Clustering Problem
Pattern Recognition and Image Analysis. 2018.
V.28. N1. P.17-23. DOI: 10.1134/s105466181801008x
Scopus
OpenAlex
|
|
13
|
Kel’manov A.
, Motkova A.
, Shenmaier V.
An Approximation Scheme for a Weighted Two-Cluster Partition Problem
Lecture Notes in Computer Science. 2018.
P.323-333. DOI: 10.1007/978-3-319-73013-4_30
Scopus
OpenAlex
|
|
14
|
Kel'manov A.
, Motkova A.
An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem
In compilation
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).
2017.
– C.94-96. DOI: 10.1109/sibircon.2017.8109845
OpenAlex
|
|
15
|
Kelʹmanov A.V.
, Motkova A.
Algorithms with performance guarantee for a weighted 2-partition problem
In compilation
CEUR Workshop Proceedings.
2017.
– Т.1987. – C.304-309.
|