Vladimir Khandeev

From MaRDI portal
Revision as of 18:53, 13 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vladimir Khandeev to Vladimir Khandeev: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1982891

Available identifiers

zbMath Open khandeev.vladimir-ilichMaRDI QIDQ1982891

List of research outcomes

PublicationDate of PublicationType
Constant-factor approximation algorithms for some maximin multi-clustering problems2023-08-21Paper
Max-Min Problems of Searching for Two Disjoint Subsets2023-04-13Paper
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems2022-10-26Paper
On the complexity of some quadratic Euclidean partition problems into balanced clusters2021-09-14Paper
Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability2021-08-03Paper
An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem2021-05-18Paper
NP-hardness of some max-min clustering problems2021-05-18Paper
Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem2021-02-25Paper
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters2020-10-22Paper
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case2020-09-22Paper
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation2020-09-22Paper
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes2020-06-24Paper
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters2020-03-11Paper
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence2020-02-11Paper
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension2020-02-07Paper
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem2020-01-14Paper
On polynomial solvability of one quadratic Euclidean clustering problem on a line2019-12-13Paper
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space2019-11-04Paper
On the complexity of some problems of searching for a family of disjoint clusters2019-06-24Paper
A randomized algorithm for a sequence 2-clustering problem2019-06-07Paper
An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities2018-04-20Paper
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities2018-02-13Paper
Approximation algorithm for the problem of partitioning a sequence into clusters2017-12-06Paper
Exact pseudopolynomial algorithm for one sequence partitioning problem2017-07-07Paper
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors2016-08-12Paper
A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem2016-08-12Paper
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem2016-07-08Paper
A 2-approximation polynomial algorithm for a clustering problem2015-07-17Paper
A randomized algorithm for two-cluster partition of a set of vectors2015-07-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vladimir Khandeev