Pages that link to "Item:Q471386"
From MaRDI portal
The following pages link to NP-hardness of the Euclidean Max-Cut problem (Q471386):
Displaying 7 items.
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- On the Hardness of Energy Minimisation for Crystal Structure Prediction (Q3297788) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
