Pages that link to "Item:Q2354448"

The following pages link to A randomized algorithm for two-cluster partition of a set of vectors (Q2354448):

Displaying 12 items.

• Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
• Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
• Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← 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)
• 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)
• Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)