| Publication | Date of Publication | Type |
|---|
Constant-factor approximation algorithms for some maximin multi-clustering problems
Mathematical Optimization Theory and Operations Research | 2023-08-21 | Paper |
| Max-Min Problems of Searching for Two Disjoint Subsets | 2023-04-13 | Paper |
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
Сибирский журнал вычислительной математики | 2022-10-26 | Paper |
| On the complexity of some quadratic Euclidean partition problems into balanced clusters | 2021-09-14 | Paper |
Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability
Proceedings of the Steklov Institute of Mathematics | 2021-08-03 | Paper |
| NP-hardness of some max-min clustering problems | 2021-05-18 | Paper |
| An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem | 2021-05-18 | Paper |
Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem
Mathematical Optimization Theory and Operations Research | 2021-02-25 | Paper |
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
Computational Mathematics and Mathematical Physics | 2020-10-22 | Paper |
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation
Lecture Notes in Computer Science | 2020-09-22 | Paper |
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case
Lecture Notes in Computer Science | 2020-09-22 | Paper |
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
Doklady Mathematics | 2020-06-24 | Paper |
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
Doklady Mathematics | 2020-03-11 | Paper |
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
Annals of Mathematics and Artificial Intelligence | 2020-02-11 | Paper |
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
Mathematical Optimization Theory and Operations Research | 2020-02-07 | Paper |
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
Computational Mathematics and Mathematical Physics | 2020-01-14 | Paper |
On polynomial solvability of one quadratic Euclidean clustering problem on a line
Doklady Mathematics | 2019-12-13 | Paper |
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
Computational Mathematics and Mathematical Physics | 2019-11-04 | Paper |
On the complexity of some problems of searching for a family of disjoint clusters
Doklady Mathematics | 2019-06-24 | Paper |
A randomized algorithm for a sequence 2-clustering problem
Computational Mathematics and Mathematical Physics | 2019-06-07 | Paper |
An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
Proceedings of the Steklov Institute of Mathematics | 2018-04-20 | Paper |
An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Approximation algorithm for the problem of partitioning a sequence into clusters
Computational Mathematics and Mathematical Physics | 2017-12-06 | Paper |
Exact pseudopolynomial algorithm for one sequence partitioning problem
Automation and Remote Control | 2017-07-07 | Paper |
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
Journal of Applied and Industrial Mathematics | 2016-08-12 | Paper |
A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
Journal of Applied and Industrial Mathematics | 2016-08-12 | Paper |
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
Computational Mathematics and Mathematical Physics | 2016-07-08 | Paper |
A 2-approximation polynomial algorithm for a clustering problem
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
A randomized algorithm for two-cluster partition of a set of vectors
Computational Mathematics and Mathematical Physics | 2015-07-13 | Paper |
