The following pages link to (Q3115710):
Displaying 8 items.
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- (Q3115696) (← 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)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
