Clustering improves the Goemans–Williamson approximation for the max-cut problem

Mathematics

• Max-cut Problem 100%
• Clustering 66%
• Clustering Algorithm 61%
• Benchmark 45%
• Graph Cuts 35%
• Approximation 35%
• K-means 32%
• Graph in graph theory 31%
• Lower bound 30%
• Initialization 28%
• Quadratic Program 28%
• Global Optimum 28%
• Rounding 27%
• Quadratic Programming 25%
• Integer Programming 25%
• Combinatorial Optimization Problem 25%
• Integer 24%
• Assign 22%
• Scalar, inner or dot product 22%
• Exceed 21%
• NP-complete problem 17%

Engineering & Materials Science

• Clustering algorithms 62%
• Quadratic programming 38%
• Combinatorial optimization 38%
• NP-hard 33%
• Relaxation 32%