The following pages link to (Q3115233):
Displaying 6 items.
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- An FPTAS for a vector subset search problem (Q5264739) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
