Pages that link to "Item:Q1662580"

The following pages link to NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580):

Displaying 1 item.

• Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (Q5090149) (← links)