Vladimir Khandeev

Available identifiers

zbMath Open khandeev.vladimir-ilichMaRDI QIDQ1982891

List of research outcomes

Publication	Date of Publication	Type
Constant-factor approximation algorithms for some maximin multi-clustering problems	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	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	2021-02-25	Paper
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters	2020-10-22	Paper
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation	2020-09-22	Paper
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case	2020-09-22	Paper
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes	2020-06-24	Paper
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters	2020-03-11	Paper
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence	2020-02-11	Paper
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension	2020-02-07	Paper
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem	2020-01-14	Paper
On polynomial solvability of one quadratic Euclidean clustering problem on a line	2019-12-13	Paper
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space	2019-11-04	Paper
On the complexity of some problems of searching for a family of disjoint clusters	2019-06-24	Paper
A randomized algorithm for a sequence 2-clustering problem	2019-06-07	Paper
An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities	2018-04-20	Paper
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities	2018-02-13	Paper
Approximation algorithm for the problem of partitioning a sequence into clusters	2017-12-06	Paper
Exact pseudopolynomial algorithm for one sequence partitioning problem	2017-07-07	Paper
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors	2016-08-12	Paper
A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem	2016-08-12	Paper
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem	2016-07-08	Paper
A 2-approximation polynomial algorithm for a clustering problem	2015-07-17	Paper
A randomized algorithm for two-cluster partition of a set of vectors	2015-07-13	Paper

Research outcomes over time

This page was built for person: Vladimir Khandeev