Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- scientific article; zbMATH DE number 1860688 (Why is no real title available?)
- A randomized approximation scheme for metric MAX-CUT
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
- Estimation of distribution algorithm for the max-cut problem
- On the complexity of a search for a subset of ``similar vectors
- Reducibility among combinatorial problems
- Some simplified NP-complete graph problems
Cited in
(10)- A randomized algorithm for two-cluster partition of a set of vectors
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- Complexity and polynomially solvable special cases of QUBO
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Complexity of the weighted max-cut in Euclidean space
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- NP-hardness of some quadratic Euclidean 2-clustering problems
- On the hardness of energy minimisation for crystal structure prediction
- Computational complexity of diagram satisfaction in Euclidean geometry
- On the complexity of some quadratic Euclidean 2-clustering problems
This page was built for publication: NP-hardness of the Euclidean Max-Cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471386)
