The following pages link to Alexander Kel'Manov (Q1982890):
Displaying 50 items.
- (Q334414) (redirect page) (← links)
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- On the complexity of a search for a subset of ``similar'' vectors (Q542229) (← links)
- Off-line detection of a quasi-periodically recurring fragment in a numerical sequence (Q735649) (← links)
- Problem of minimizing a sum of differences of weighted convolutions (Q828127) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (Q1395276) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← 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)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← 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)
- Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences (Q2048804) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Maximum diversity problem with squared Euclidean distance (Q2181789) (← 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)
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← 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)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← 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)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- (Q2836761) (← links)
- Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов (Q2838802) (← links)
- On the complexity of some cluster analysis problems (Q2901122) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Complexity of certain problems of searching for subsets of vectors and cluster analysis (Q2995693) (← links)
- On the complexity of some data analysis problems (Q2996037) (← links)
- (Q2998954) (← links)
- (Q2998977) (← links)
- (Q2998997) (← links)
