Pages that link to "Item:Q5264746"

The following pages link to Complexity of the weighted max-cut in Euclidean space (Q5264746):

Displaying 3 items.

• NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
• On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
• Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)