2 problems

Recovery threshold conjecture for the K-means linear-programming relaxation
Recovery-threshold conjecture. If $\Delta > 2.14$ , then Problem recovers the planted clusters with high probability.
openFrom papersk-means-clustering linear-programming stochastic-block-model
0 responses
4
Conjecture on Peng–Wei exact recovery for the generalized stochastic ball model
Exact-recovery conjecture. The Peng–Wei relaxation achieves exact recovery with high probability if
openFrom papersk-means-clustering semidefinite-programming stochastic-ball-model
0 responses
8

Recovery threshold conjecture for the K-means linear-programming relaxation