The following pages link to Vladimir Khandeev (Q1982891):
Displayed 29 items.
- (Q1683188) (redirect page) (← links)
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- On the complexity of some quadratic Euclidean partition problems into balanced clusters (Q1982892) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- NP-hardness of some max-min clustering problems (Q2026156) (← links)
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes (Q2191318) (← links)
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
- On polynomial solvability of one quadratic Euclidean clustering problem on a line (Q2279767) (← links)
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- Exact pseudopolynomial algorithm for one sequence partitioning problem (Q2362334) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- On the complexity of some problems of searching for a family of disjoint clusters (Q2424385) (← links)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities (Q3133210) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem (Q4965097) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (Q5122317) (← links)
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation (Q5122318) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- A 2-approximation polynomial algorithm for a clustering problem (Q5263825) (← links)
- Constant-factor approximation algorithms for some maximin multi-clustering problems (Q6134049) (← links)