On the complexity of some quadratic Euclidean 2-clustering problems von Kel’manov, A. V., Pyatkin, A. V.

Volltext

An FPTAS for a vector subset search problem von Kel’manov, A. V., Romanchenko, S. M.

Volltext

On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line von Kel’manov, A. V., Khandeev, V. I.

Volltext

Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem von Kel’manov, A. V., Khandeev, V. I.

Volltext

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center von Kel’manov, A. V., Motkova, A. V.

Volltext

NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points von Kel’manov, A. V., Pyatkin, A. V.

Volltext

Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Size of the Clusters: Complexity and Approximability von Kel’manov, A. V., Pyatkin, A. V., Khandeev, V. I.

Volltext

A randomized algorithm for two-cluster partition of a set of vectors von Kel’manov, A. V., Khandeev, V. I.

Volltext

On the Complexity of SomeMax–Min Clustering Problems von Kel’manov, A. V., Pyatkin, A. V., Khandeev, V. I.

Volltext

NP-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes von Kel’manov, A. V., Pyatkin, A. V., Khandeev, V. I.

Volltext

NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters von Kel’manov, A. V., Pyatkin, A. V., Khandeev, V. I.

Volltext

Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space von Kel’manov, A. V., Panasenko, A. V., Khandeev, V. I.

Volltext

On the complexity of some Euclidean problems of partitioning a finite set of points von Kel’manov, A. V., Pyatkin, A. V.

Volltext

On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters von Kel’manov, A. V., Pyatkin, A. V., Khandeev, V. I.

Volltext

A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets von Galashov, A. E., Kel’manov, A. V.

Volltext

An approximation algorithm for solving a problem of search for a vector subset von Kel’manov, A. V., Romanchenko, S. M.

Volltext

Approximation Scheme for the Problem of Weighted 2-Clustering with a Fixed Center of One Cluster von Kel’manov, A. V., Motkova, A. V., Shenmaier, V. V.

Volltext

Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters von Dolgushev, A. V., Kel’manov, A. V., Shenmaier, V. V.

Volltext

On complexity of some problems of cluster analysis of vector sequences von Kel’manov, A. V., Pyatkin, A. V.

Volltext

An approximation polynomial-time algorithm for a sequence bi-clustering problem von Kel’manov, A. V., Khamidullin, S. A.

Volltext