Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming
arXiv:2601.03946v3 Announce Type: replace-cross Abstract: We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero ent