The following pages link to (Q2998954):
Displaying 31 items.
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- Off-line detection of a quasi-periodically recurring fragment in a numerical sequence (Q735649) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (Q1395276) (← links)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← 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)
- 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)
- 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)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- (Q2998997) (← links)
- (Q3161901) (← links)
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (Q3186828) (← 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)
- NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors (Q3439514) (← links)
- Asymptotically optimal approach for solving some hard discrete optimization problems (Q3439515) (← links)
- (Q4951235) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
- (Q5393721) (← links)
- A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence (Q6191497) (← links)
- PTAS for problems of vector choice and clustering with different centers (Q6644072) (← links)
