The following pages link to (Q3115696):
Displaying 9 items.
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- Vectors in a box (Q715080) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- (Q3115710) (← 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)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
