The following pages link to (Q3115657):
Displaying 15 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)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← 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)
- 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)
- 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)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
